L.G. Valiant and V.V. Vazirani, "NP is as easy as detecting unique solutions", Theoret. Comput. Sci., Vol. 47, pp. 85--93, 1986. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
On the Reducibility of Sets Inside NP to Sets with Low.. - Ogihara, Tantau (2002) (Correct)
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (5 citations) (Correct)
Quantum vs. Classical Communication and Computation - Harry Buhrman Cwi (Correct)
Fair Games Against an All-Powerful Adversary - Rafail Ostrovsky Ramarathnam (1993) (9 citations) (Correct)
Fixed-Parameter Tractability and Completeness I: Basic Results - Downey, Fellows (1995) (145 citations) (Correct)
Multilinear Formulas and Skepticism of Quantum Computing - Aaronson (2004) (2 citations) (Correct)
On Worst-Case to Average-Case Reductions for NP Problems - Andrej Bogdanov Luca (2003) (1 citation) (Correct)
Making Nondeterminism Unambiguous - Reinhardt, Allender (1997) (5 citations) (Correct)
On the Computational Complexity of Sensor Network.. - Aspnes, Goldenberg, Yang (2004) (3 citations) (Correct)
Membership Comparable and p-selective Sets - Beigel, Fortnow, Pavan (Correct)
Some Results on Derandomization - Buhrman, Fortnow, Pavan (Correct)
Knowledge Compilation and Theory Approximation - Selman, Kautz (1996) (56 citations) (Correct)
Multilinear Formulas and Skepticism of Quantum Computing - Aaronson (2004) (2 citations) (Correct)
The Computational Complexity Column - Lance Fortnow Nec (Correct)
Resource-Bounded Kolmogorov Complexity Revisited - Buhrman, Fortnow, Laplante (2001) (9 citations) (Correct)
On the Computational Complexity of Sensor Network.. - Aspnes, Goldenberg, Yang (2004) (3 citations) (Correct)
Tiny Families of Functions with Random Properties: A.. - Goldreich, Wigderson (2003) (31 citations) (Correct)
On the Computational Complexity of Sensor Network.. - Aspnes, Goldenberg, Yang (2004) (3 citations) (Correct)
Unknown - (1992) (Correct)
Kolmogorov Complexity and Computational Complexity - Fortnow (2004) (1 citation) (Correct)
Membership Comparable and p-selective Sets - Beigel, Fortnow, Pavan (Correct)
Quantum Computation - Aharonov (1998) (1 citation) (Correct)
Lower Bounds and the Hardness of Counting Properties - Hemaspaandra, Thakur (2002) (Correct)
The Power of the Middle Bit of a #P Function - Green, Köbler, Regan.. (1997) (15 citations) (Correct)
Witness-Isomorphic Reductions and the Local - Search Problem Extended (Correct)
First 50 documents Next 50
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