|
41
|
Combinatorial Property Testing (a survey)
– Oded Goldreich
- 1998
|
|
71
|
Property Testing
– Dana Ron
- 2000
|
|
45
|
Testing Monotonicity
– Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky
- 1999
|
|
11
|
A Combinatorial Consistency Lemma with application to proving the PCP Theorem
– Oded Goldreich, Shmuel Safra
- 1997
|
|
14
|
A Taxonomy of Proof Systems
– Oded Goldreich
- 1997
|
|
39
|
Some Improvements to Total Degree Tests
– Katalin Friedl, Madhu Sudan
- 1995
|
|
2
|
On the Role of Algebra in the Efficient Verification of Proofs
– Madhu Sudan
- 1994
|
|
7
|
Exact and approximate testing/correcting of algebraic functions: A survey
– Marcos Kiwi, Frédéric Magniez, Miklos Santha
- 2001
|
|
605
|
Proof verification and hardness of approximation problems
– Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
- 1992
|
|
|
Probabilistic Proof Systems: A Primer
– Oded Goldreich
- 2008
|
|
13
|
Testing Acyclicity of Directed Graphs in Sublinear Time
– Michael A. Bender, Dana Ron
- 2000
|
|
|
Testing Reed Muller Codes ∗
– Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
|
|
55
|
Locally Testable Codes and PCPs of Almost-Linear Length
– Oded Goldreich, Madhu Sudan
- 2002
|
|
5
|
Probabilistic Proof Systems -- A Survey
– Oded Goldreich
- 1996
|
|
107
|
Property Testing in Bounded Degree Graphs
– Oded Goldreich, Dana Ron
- 1997
|
|
42
|
Some Applications of Coding Theory in Computational Complexity
– Luca Trevisan
- 2004
|
|
68
|
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding
– Eli Ben-sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil Vadhan
- 2004
|
|
7
|
Robust PCPs of proximity and shorter PCPs
– Prahladh Harsha
- 2004
|
|
1
|
Breaking the ɛ-Soundness Bound of the Linearity Test over GF(2)
– Tali Kaufman, Simon Litsyn, Ning Xie
- 2008
|