Probabilistically Checkable Proofs and the Testing of Hadamard-like Codes (1996)

Cached

Download Links

by Marcos Kiwi
Citations:15 - 3 self

Active Bibliography

Alternation in Interaction – n.n.
726 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
14 A Taxonomy of Proof Systems – Oded Goldreich - 1997
649 Some optimal inapproximability results – Johan Håstad - 2002
368 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
637 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998
The Weizmann Workshop on Probabilistic Proof Systems – Uriel Feige, Shafi Goldwasser (Eds.) - 1994
15 The approximability of NP-hard problems – Sanjeev Arora - 1998