Google

Category
 
Recent Entries
 
Archives
 
Links
 
Visitors

You have 1726968 hits.

 
Latest Comments


 
Posted By Peter Bentley
Here's another recent communication from a reader of the Book of Numbers. More unusual one this...

I have read your book, Digital Biology and found it very good. It is possible that we have devised a new theory that is capable of solving the NP Complete class of problems. We have been testing the resulting algorithm with the Knapsack Problem generating large combinatorial explosions, like n150. Precise results show up in less than 2 hours on a not very fast laptop. Would you propose us a definitive test? Best regards

I'm glad you enjoyed the book. There have been many algorithms recently that demonstrate impressive results for limited classes of problems, but normally exceptions are found that prevent the algorithms from truly solving all NP Complete problems. If you are interested you may like to contact one of our researchers at UCL who obtained his doctorate in this area... [details omitted]


 
0 Comment(s):
No Comments are found for this entry.
Add a new comment using the form below.

 
Leave a Comment:
Name: * Email: *
Home Page URL:
Comment: *
   char left.

re-generate
Enter the text shown in the image on the left: *
 Remember Me?
* fields are requried