See this document in CiteSeerX!

Three Theorems Regarding Testing Graph Properties (2003)  (Make Corrections)  (14 citations)
Oded Goldreich, Luca Trevisan
IEEE Symposium on Foundations of Computer Science



  Home/Search   Context   Related

 
View or download:
berkeley.edu/~luca/pubs/gt03.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/~luca/pubs/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Property testing is a relaxation of decision problems in which it is required to distinguish YES-instances (i.e., objects having a predetermined property) from instances that are far from any YES-instance. We presents three theorems regarding testing graph properties in the adjacency matrix representation. More specifically, these theorems relate to the project of characterizing graph properties according to the complexity of testing them (in the adjacency matrix representation). The first... (Update)

Cited by:   More
Testing Euclidean Minimum Spanning Trees in the Plane + - Artur Czumaj Department   (Correct)
Testing Convex Position - Czumaj, Sohler, Ziegler (2000)   (Correct)
Lower Bounds for Testing Bipartiteness in Dense Graphs - Bogdanov, Trevisan (2002)   (Correct)

Active bibliography (related documents):   More   All
0.5:   A Characterization of Easily Testable Induced Subgraphs - Alon, Shapira (2004)   (Correct)
0.5:   The art of uninformed decisions: A primer to property testing - Fischer (2001)   (Correct)
0.2:   Testing Subgraphs in Directed Graphs - Alon, Shapira (2003)   (Correct)

Similar documents based on text:   More   All
0.3:   Property Testing in Bounded Degree Graphs - Goldreich, Ron (1998)   (Correct)
0.3:   Adaptively Secure Multi-party Computation - Canetti, Feige, Goldreich, Naor (1995)   (Correct)
0.2:   Property Testing and its Connection to Learning and.. - Goldreich, Goldwasser, Ron (1998)   (Correct)

Related documents from co-citation:   More   All
10:   Property testing and its connection to learning and approximation - Goldreich, Goldwasser et al.
10:   Robust characterization of polynomials with applications to program testing - Rubinfeld, Sudan - 1996
8:   Property testing in bounded degree graphs - Goldreich, Ron - 1997

BibTeX entry:   (Update)

O. Goldreich and L. Trevisan. Three theorems regarding testing graph properties. In Proceedings of the 42th IEEE Symposium on Foundations of Computer Science, pages 460-469. IEEE, Nevada, 2001. http://citeseer.ist.psu.edu/goldreich03three.html   More

@inproceedings{ goldreich01three,
    author = "Oded Goldreich and Luca Trevisan",
    title = "Three Theorems Regarding Testing Graph Properties",
    booktitle = "{IEEE} Symposium on Foundations of Computer Science",
    pages = "460-469",
    year = "2001",
    url = "citeseer.ist.psu.edu/goldreich03three.html" }
Citations (may not include all citations):
957   The probabilistic method (context) - Alon, Spencer - 1992
167   Property testing and its connection to learning and approxim.. - Goldreich, Goldwasser et al. - 1998
138   Small-bias probability spaces: Efficient constructions and a.. - Naor, Naor - 1993
128   Simple constructions of almost k-wise independent random var.. - Alon, Goldreich et al. - 1992
115   Robust characterization of polynomials with applications to .. - Rubinfeld, Sudan - 1996
30   Efficient testing of large graphs - Alon, Fischer et al. - 2000
14   Three theorems regarding testing graph properties - Goldreich, Trevisan - 2001
7   Discrete Math (context) - Alon, Krivelevich et al. - 2002
6   Sampling algorithms: Lower bounds and applications (context) - Bar-Yossef, Kumar et al. - 2001
3   Combinatorial property testing---a survey - Goldreich - 1998
1   Property testing (a tutorial (context) - Ron - 2001
1   On properties closed under taking induced subgraphs (context) - Alon - 2001



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.berkeley.edu/~luca/pubs/):   More
Compression of Samplable Sources - Trevisan, Vadhan, Zukerman   (Correct)
Streaming Computation of Combinatorial Objects - Bar-Yossef, Reingold, al. (2002)   (Correct)
Notions of Reducibility between Cryptographic Primitives - Reingold, Trevisan, Vadhan (2004)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC