Testing st -Connectivity
暂无分享,去创建一个
[1] Noga Alon,et al. A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[2] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.
[3] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[4] Dana Ron,et al. Testing the diameter of graphs , 1999, RANDOM-APPROX.
[5] C. SIAMJ.. TESTING MEMBERSHIP IN LANGUAGES THAT HAVE SMALL WIDTH BRANCHING PROGRAMS , 2002 .
[6] Noga Alon,et al. Testing triangle-freeness in general graphs , 2006, SODA '06.
[7] Dekel Tsur,et al. Testing Orientation Properties , 2005, Electron. Colloquium Comput. Complex..
[8] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[9] E. Fischer. THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .
[10] Dekel Tsur,et al. Testing Properties of Constraint-Graphs , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[11] Gheorghe Paun,et al. Current Trends in Theoretical Computer Science: The Challenge of the New Century , 2004 .
[12] Dana Ron,et al. Tight Bounds for Testing Bipartiteness in General Graphs , 2004, RANDOM-APPROX.
[13] Sanguthevar Rajasekaran. Handbook of randomized computing , 2001 .
[14] Noga Alon,et al. A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.
[15] GoldreichOded,et al. Property testing and its connection to learning and approximation , 1998 .
[16] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.