A sublinear bipartiteness tester for bounded degree graphs

Combinatorica

Volumn 19, Issue 3, 1999, Pages 335-373

  Goldreich, Oded ^a   Ron, Dana ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040113668     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050060     Document Type: Article

References (16)

1. D. ALDOUS , On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing, Probability in Engineering and Information Sciences, 1 (1987), 33-46.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN and M. SZEGEDY: Proof verification and intractability of approximation problems, in: Proceedings of the Thirty-Third Annual Symposium on Foundations of Computer Science, (1992), 14-23,
3. N. ALON: Eigenvalues and expanders, Combinatorica, 6(2) (1986), 83-96.
4. N. ALON and J. H. SPENCER: The Probabilistic Method, John Wiley& Sons, Inc., 1992.
5. S. ARORA AND S. SAFRA: Probabilistic checkable proofs: A new characterization of NP, In: Proceedings of the Thirty-Third Annual Symposium on Foundations of Computer Science, (1992), 1-13.
6. B. AWERBUCH: The complexity of network synchronization, Journal of the Association for Computing Machinery, 32(4) (1985), 804-823.
7. L. BABAI, L. FORTNOW and C. LUND: Non-deterministic exponential time has two-prover interactive protocols, Computational Complexity, 1(1) (1991), 3-40.
8. L. BABAI, L. FORTNOW, L. LEVIN and M. SZEGEDY: Checking computations in polylogarithmic time, in: Proceedings of the Twenty-Third Annual ACM Symposium, on Theory of Computing (1991), 21-31.
9. M. BLUM, M. LUBY, and R. RUBINFELD: Self-testing/Correcting with applications to numerical problems, Journal of Computer and System Sciences, 47 (1993), 547-595.
10. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA and M. SZEGEDY: Approximating clique is almost NP-complete, in: Proceedings of the Thirty-Second Annual Symposium on Foundations of Computer Science, (1991), 2-12.
11. O. GOLDREICH, S. GOLDWASSER and D. RON: Property testing and its connection to learning and approximation, in: Proceedings of the Thirty-Seventh Annual Symposium on Foundations of Computer Science, (1996), 339-348.
12. O. GOLDREICH AND D. RON: Property testing in bounded degree graphs, in: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, (1997), 406-415.
13. M. MIHAIL: Conductance and convergence of Markov chains - A combinatorial treatment of expanders, in: Proceedings 30th Annual Conference on Foundations of Computer Science, (1989), 526-531.
14. R. RUBINFELD and M. SUDAN: Robust characterization of polynomials with applications to program testing, SIAM Journal on Computing, 25(2) (1996), 252-271.
15. R. RUBINFELD: Robust functional equations and their applications to program testing, Proceedings of the Thirty-Fifth Annual Symposium on Foundations of Computer Science, 1994.
16. A. SINCLAIR and M. R. JERRUM: Approximate counting, uniform generation and rapidly mixing Markov chains, Information and Computation, 82(1) (1989), 93-133.