Sciweavers

STOC
2010
ACM
244views Algorithms» more  STOC 2010»
14 years 10 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams