Monday, 20 June 2016

computational complexity - Does P≠NP over ℝ imply P≠NP ?

Does P≠NP over ℝ imply P≠NP ?



where ℝ is for Real number algorithms as described by Smale with a suitable formulation of P≠NP over ℝ.



Complexity Theory and Numerical Analysis, Steve Smale, 2000
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.33.4678&rep=rep1&type=pdf

No comments:

Post a Comment