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 Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On the Reducibility of Sets Inside NP to Sets with Low.. - Ogihara, Tantau (2002) (Correct)
.... has no satisfying assignment then 62 B. Now suppose has exactly one satisfying assignment. Then i 2 1SAT for all i, and A ( 1 ; n ) will be the satisfying assignment of , and hence 2 B. This shows that B 2 P is a solution of (1SAT; SAT) By Valiant and Vazirani s result [60] we get SAT 2 RP. Proof of Theorem 5. Let GI 2 P mc(c log n) for some c via f . We show GI 2 RP. Let (G 0 ; G 1 ) be a pair of graphs given as input. We run Algorithm 1. We claim that the algorithm will never accept non isomorphic graphs and will accept isomorphic graphs with probability at least ....
L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Comput. Sci., 47:85-93, 1986.
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (5 citations) (Correct)
No context found.
L.G. Valiant and V.V. Vazirani, "NP is as easy as detecting unique solutions", Theoret. Comput. Sci., Vol. 47, pp. 85--93, 1986.
Quantum vs. Classical Communication and Computation - Harry Buhrman Cwi (Correct)
No context found.
L.G. Valiant and V.V. Vazirani, "NP is as easy as detecting unique solutions", Theoret. Comput. Sci., Vol. 47, pp. 85--93, 1986.
Fair Games Against an All-Powerful Adversary - Rafail Ostrovsky Ramarathnam (1993) (9 citations) (Correct)
No context found.
L. Valiant and V. Vazirani, NP is as easy as detecting unique solutions, Proc. ACM Symp. on Theory of Computing, 1985.
Fixed-Parameter Tractability and Completeness I: Basic Results - Downey, Fellows (1995) (145 citations) (Correct)
No context found.
L.G.Valiant and V.V.Vazirani, "NP is as easy as detecting unique solutions,"Theoretical Computer Science 47 (1986), 85-93.
Multilinear Formulas and Skepticism of Quantum Computing - Aaronson (2004) (2 citations) (Correct)
No context found.
L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions, Theoret. Comp. Sci. 47(3):85--93, 1986.
On Worst-Case to Average-Case Reductions for NP Problems - Andrej Bogdanov Luca (2003) (1 citation) (Correct)
No context found.
Leslie Valiant and Vijay Vazirani. NP is as easy as detecting unique solutions. Theoretical
Making Nondeterminism Unambiguous - Reinhardt, Allender (1997) (5 citations) (Correct)
No context found.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85--93, 1986.
On the Computational Complexity of Sensor Network.. - Aspnes, Goldenberg, Yang (2004) (3 citations) (Correct)
No context found.
Leslie G. Valiant and Vijay V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(1):85--93, 1986.
Membership Comparable and p-selective Sets - Beigel, Fortnow, Pavan (Correct)
No context found.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85-93, 1986. 10
Some Results on Derandomization - Buhrman, Fortnow, Pavan (Correct)
No context found.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85--93, 1986.
Knowledge Compilation and Theory Approximation - Selman, Kautz (1996) (56 citations) (Correct)
No context found.
R.G. Valiant and Vazirani V.V. Np is as easy as detecting unique solutions. Theoretical Computer Science, 47:85--93, 1986.
Multilinear Formulas and Skepticism of Quantum Computing - Aaronson (2004) (2 citations) (Correct)
No context found.
L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions, Theoret. Comp. Sci. 47(3):85--93, 1986.
The Computational Complexity Column - Lance Fortnow Nec (Correct)
No context found.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85-93, 1986.
Resource-Bounded Kolmogorov Complexity Revisited - Buhrman, Fortnow, Laplante (2001) (9 citations) (Correct)
No context found.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. In Proceedings of the 17th ACM Symposium on the Theory of Computing, pages 458-463, 1985.
On the Computational Complexity of Sensor Network.. - Aspnes, Goldenberg, Yang (2004) (3 citations) (Correct)
No context found.
Leslie G. Valiant and Vijay V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(1):85--93, 1986.
Tiny Families of Functions with Random Properties: A.. - Goldreich, Wigderson (2003) (31 citations) (Correct)
No context found.
L. Valiant and V.V. Vazirani, "NP is as Easy as Detecting Unique Solutions", Theoretical Computer Science, Vol. 47, 1986, pp. 85--93.
On the Computational Complexity of Sensor Network.. - Aspnes, Goldenberg, Yang (2004) (3 citations) (Correct)
No context found.
Leslie G. Valiant and Vijay V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(1):85--93, 1986.
Unknown - (1992) (Correct)
No context found.
L.Valiant, V.Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science, 47 (1986) 85-93
Kolmogorov Complexity and Computational Complexity - Fortnow (2004) (1 citation) (Correct)
No context found.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85--93, 1986. 12
Membership Comparable and p-selective Sets - Beigel, Fortnow, Pavan (Correct)
No context found.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85--93, 1986. 9
Quantum Computation - Aharonov (1998) (1 citation) (Correct)
No context found.
Valiant L G and Vazirani V V. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(1):85-93, 1986
Lower Bounds and the Hardness of Counting Properties - Hemaspaandra, Thakur (2002) (Correct)
No context found.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(3):85--93, 1986. 21
The Power of the Middle Bit of a #P Function - Green, Köbler, Regan.. (1997) (15 citations) (Correct)
No context found.
L. Valiant and V. Vazirani, NP is as easy as detecting unique solutions. In Theoretical Computer Science 47, (1986), 85-93.
Witness-Isomorphic Reductions and the Local - Search Problem Extended (Correct)
No context found.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. In Proc. 17th ACM Symp. Theory of Computing, pages 458--463, 1985.
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