Sciweavers

COCO
2007
Springer
94views Algorithms» more  COCO 2007»
13 years 11 months ago
Bounded Queries and the NP Machine Hypothesis
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
Richard Chang, Suresh Purini