Generic separations (1996)

View PDF

Download Links

by Harry Buhrman , Lance Fortnow , Thomas Thierauf
Venue:JOURNAL OF COMPUTER AND SYSTEMS SCIENCES

Active Bibliography

723 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
658 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998
407 Non-Deterministic Exponential Time has Two-Prover Interactive Protocols – Laszlo Babai, Lance Fortnow, Carsten Lund
660 Some optimal inapproximability results – Johan HÃ¥stad - 2002
454 Private Information Retrieval – Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan - 1997
1086 The knowledge complexity of interactive proof systems – Shafi Goldwasser, Silvio Micali, Charles Rackoff - 1985
497 Quantum complexity theory – Ethan Bernstein, Umesh Vazirani - 1993
312 Algebraic Methods for Interactive Proof Systems – Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan - 1990
430 Property Testing and its connection to Learning and Approximation – Oded Goldreich, Shafi Goldwasser, Dana Ron