The complexity of decision versus search (1994)

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

Active Bibliography

726 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
407 Non-Deterministic Exponential Time has Two-Prover Interactive Protocols – Laszlo Babai, Lance Fortnow, Carsten Lund
368 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
649 Some optimal inapproximability results – Johan Håstad - 2002
637 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998
2980 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
641 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
1718 A Theory of the Learnable – L. G. Valiant - 1984
479 Entity Authentication and Key Distribution – Mihir Bellare, Phillip Rogaway - 1993