Property Testing and its connection to Learning and Approximation

by Oded Goldreich , Shafi Goldwasser , Dana Ron
Citations:414 - 57 self

Active Bibliography

43 Combinatorial Property Testing (a survey) – Oded Goldreich - 1998
76 Property Testing – Dana Ron - 2000
Probabilistic Proof Systems: A Primer – Oded Goldreich - 2008
57 Testing Monotonicity – Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky - 1999
13 The approximability of NP-hard problems – Sanjeev Arora - 1998
13 Testing Acyclicity of Directed Graphs in Sublinear Time – Michael A. Bender, Dana Ron - 2000
5 Probabilistic Proof Systems -- A Survey – Oded Goldreich - 1996
15 A Taxonomy of Proof Systems – Oded Goldreich - 1997
119 Property Testing in Bounded Degree Graphs – Oded Goldreich, Dana Ron - 1997
15 A Combinatorial Consistency Lemma with application to proving the PCP Theorem – Oded Goldreich, Shmuel Safra - 1997
2 On the Role of Algebra in the Efficient Verification of Proofs – Madhu Sudan - 1994
44 Some Improvements to Total Degree Tests – Katalin Friedl, Madhu Sudan - 1995
49 Some Applications of Coding Theory in Computational Complexity – Luca Trevisan - 2004
7 Exact and approximate testing/correcting of algebraic functions: A survey – Marcos Kiwi, Frédéric Magniez, Miklos Santha - 2001
718 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
68 Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems – Madhu Sudan - 1992
9 Testing Properties of Directed Graphs: Acyclicity and Connectivity – Michael A. Bender, Dana Ron - 2002
118 Improved Non-Approximability Results – Mihir Bellare, Madhu Sudan - 1994
Testing Reed Muller Codes ∗ – Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron