The complexity of decision versus search (1994)

by Mihir Bellare , Shafi Goldwasser
Venue:SIAM Journal on Computing
Citations:32 - 1 self

Active Bibliography

39 P-Selective Sets, and Reducing Search to Decision vs. Self-Reducibility – Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman - 1993
13 Languages that are Easier than their Proofs – Richard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser - 1991
29 Randomness, Interactive Proofs and . . . – Oded Goldreich - 1987
208 Free Bits, PCPs and Non-Approximability -- Towards Tight Results – Mihir Bellare, Oded Goldreich, Madhu Sudan - 1996
25 On Being Incoherent Without Being Very Hard – Richard Beigel, Joan Feigenbaum - 1992
1 How NP Got a New Definition: A Survey of Probabilistically Checkable Proofs ∗ – Sanjeev Arora - 2003
13 The approximability of NP-hard problems – Sanjeev Arora - 1998
101 Hardness Of Approximations – Sanjeev Arora , Carsten Lund - 1996
365 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
Studies in the Efficiency and (versus) Security of Cryptographic Tasks – Mohammad Mahmoody-ghidary
402 Non-Deterministic Exponential Time has Two-Prover Interactive Protocols – Laszlo Babai, Lance Fortnow, Carsten Lund
9 On helping and interactive proof systems – V. Arvind, J. Köbler, R. Schuler - 1995
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
1 Some Results on Derandomization – Harry Buhrman, Lance Fortnow
Interactive and probabilistic proof-checking – Luca Trevisan - 2000
49 Some Applications of Coding Theory in Computational Complexity – Luca Trevisan - 2004
Comparing Notions of Full Derandomization – Lance Fortnow Nec, Lance Fortnow - 2001
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002