Forums
New posts
Search forums
Members
Current visitors
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
Archive
Archive
Java
My OPE & the Euclicidean TSP
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
[QUOTE="Patricia Shanahan, post: 3615090"] What disinterest? A polynomial time algorithm for an NP-complete problem would be *very* interesting, though statistically unlikely. I've studied mathematical fallacies since I was a teenager, and ways software can be wrong for decades, so a not quite correct attempt at an algorithm could also be somewhat interesting, and much more likely. You won't find much, other than my newsgroup postings and a couple of papers on ubiquitous computing. All my production programming and computer architecture work has been as an employee of various computer manufacturers. You could try the US patent database. I'm the Patricia Shanahan who lives in California. That does reflect a couple of the computer systems I helped design, the Celerity C1200 and the Sun Fire 15K. Patricia [/QUOTE]
Verification
Post reply
Forums
Archive
Archive
Java
My OPE & the Euclicidean TSP
Top