<F4.08e+05> S. Arora, R. Impagliazzo, and U.<F4.039e+05> Vazirani,<F4.112e+05> On the Role of the Cook-Levin Theorem in Complexity<F4.039e+05> Theory, manuscript, 1993.  Home/Search   Document Not in Database   Summary   Related Articles

.... evidence that QTMs are more powerful than classical probabilistic TMs with bounded error probability [11] One could ask what the relevance of these oracle results is, in view of the nonrelativizing results on probabilistically checkable proofs [36, 3] Moreover, Arora, Impagliazzo, and Vazirani [2] make the case that the fact that the P versus NP question relativizes does not imply that the question cannot be resolved by current techniques in complexity theory. On the other hand, in our oracle results (and also in the subsequent results of [39] the key property of oracles that is ....

<F4.08e+05> S. Arora, R. Impagliazzo, and U.<F4.039e+05> Vazirani,<F4.112e+05> On the Role of the Cook-Levin Theorem in Complexity<F4.039e+05> Theory, manuscript, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC