Algorithmic Aspects of Property Testing in the Dense Graphs Model

A male contraceptive preparation is disclosed. The contraceptive preparation consists essentially of 1,2,3-trihydroxypropane in solution in a suitable carrier such as distilled water or saline solution. The method of contraception comprises injecting the contraceptive preparation into the testes. The 1,2,3-trihydroxypropane has been found to act as a potent inhibitor of spermatogenesis, resulting in long term infertility, with no apparent effect on libido, secondary sex characters, mating behaviour and hormone levels. There are no observed side effects and no observed effects on other aspects of reproductive and hormonal biology.

[1]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[2]  Dana Ron,et al.  Testing the diameter of graphs , 1999, RANDOM-APPROX.

[3]  Noga Alon,et al.  Testing subgraphs in large graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[4]  Dana Ron,et al.  On the Benefits of Adaptivity in Property Testing of Dense Graphs , 2010, Algorithmica.

[5]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[6]  Noga Alon,et al.  A characterization of easily testable induced subgraphs , 2004, SODA '04.

[7]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[8]  Eldar Fischer.  On the strength of comparisons in property testing , 2004, Inf. Comput..

[9]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[10]  Dana Ron,et al.  Property Testing: A Learning Theory Perspective , 2007, COLT.

[11]  Dana Ron,et al.  Property Testing , 2000 .

[12]  Sofya Raskhodnikova,et al.  A Note on Adaptivity in Testing Properties of Bounded Degree Graphs , 2006, Electron. Colloquium Comput. Complex..

[13]  Eli Ben-Sasson,et al.  3CNF Properties are Hard to Test , 2003, Electron. Colloquium Comput. Complex..

[14]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

[15]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[16]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[17]  Dana Ron,et al.  On proximity oblivious testing , 2009, STOC '09.

[18]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[19]  Oded Goldreich,et al.  On the lowest level of query complexity in testing graph properties , 2009 .

[20]  Y Groner,et al.  The Weizmann Institute of Science , 1962, Nature.

[21]  Ran Canetti,et al.  Lower Bounds for Sampling Algorithms for Estimating the Average , 1995, Inf. Process. Lett..

[22]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[23]  Dana Ron,et al.  Algorithmic and Analysis Techniques in Property Testing , 2010, Found. Trends Theor. Comput. Sci..

[24]  Luca Trevisan,et al.  Lower bounds for testing bipartiteness in dense graphs , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[25]  Dana Ron,et al.  Tight Bounds for Testing Bipartiteness in General Graphs , 2004, RANDOM-APPROX.

[26]  Noga Alon,et al.  Testing of bipartite graph properties ∗ , 2005 .

[27]  M. A. Perles.  ON THE NUMBER OF SUBGRAPHS OF PRESCRIBED TYPE OF GRAPHS WITH A GIVEN NUMBER OF EDGES* , 2007 .