Testing for concise representations

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 549-558

  Diakonikolas, Ilias ^a   Lee, Homin K ^a   Matulef, Kevin ^b   Onak, Krzysztof ^b   Rubinfeld, Ronitt ^b   Servedio, Rocco A ^a   Wan, Andrew ^a  

^a Och Spine at New York Presbyterian Hospitals

^b Dept of Aeronautics and Astronautics

Author keywords

[No Author keywords available]

Indexed keywords

(MIN ,MAX ,+) FUNCTIONS; (SPM) CLASSES; ALGEBRAIC CIRCUITS; APPLIED (CO); BOOLEAN CIRCUITS; BOOLEAN FORMULAS; CONCISE REPRESENTATIONS; DNF FORMULAS; FINITE FIELDS; FISCHER; GENERAL METHOD; INPUT VARIABLES; LEARNING THEORIES; LOWER BOUNDS; POLYNOMIAL FACTORING; PROPERTY (S); PROPERTY TESTER; QUERY COMPLEXITY; SPARSE POLYNOMIALS; TESTING ALGORITHMS; VALUED FUNCTION;

BOOLEAN ALGEBRA; COMPUTER SCIENCE; CONTROL THEORY; DECISION MAKING; DECISION THEORY; DECISION TREES; DESCRIBING FUNCTIONS; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; FUNCTION EVALUATION; GATES (TRANSISTOR); MILITARY DATA PROCESSING; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TESTING;

BOOLEAN FUNCTIONS;

EID: 46749151826     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389524     Document Type: Conference Paper

References (16)

1. N. Alon, T. Kaufman, M. Krivelevich, S. Litsyn, and D. Ron. Testing low-degree polynomials over GF(2). In Proceedings of RANDOM-APPROX, pages 188-199, 2003.
2. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. J. Comp. Sys. Sci., 47:549-595, 1993. Earlier version in STOC'90.
3. H. Chockler and D. Gutfreund. A lower bound for testing juntas. Information Processing Letters, 90(6):301-305, 2004.
4. P. Diaconis. Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward, CA, 1988.
5. E. Fischer. The art of uninformed decisions: A primer to property testing. Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science, 75:97-126, 2001.
6. E. Fischer, G. Kindler, D. Ron, S. Safra, and A. Samorodnitsky. Testing juntas. Journal of Computer & System Sciences, 68:753-787, 2004.
7. O. Goldreich, S. Goldwaser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45:653-750, 1998.
8. C. Jutla, A. Patthak, A. Rudra, and D. Zuckerman. Testing low-degree polynomials over prime fields. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS '04), pages 423-432, 2004.
9. T. Kaufman and D. Ron. Testing polynomials over general fields. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS '04), pages 413-422, 2004.
10. M. Kearns and D. Ron. Testing problems with sub-learning sample complexity. J. Comp. Sys. Sci., 61:428-456, 2000.
11. N. Nisan and M. Szegedy. On the degree of Boolean functions as real polynomials. In Proceedings of the Twenty-Fourth Annual Symposium on Theory of Computing, pages 462-467, 1992.
12. M. Parnas, D. Ron, and A. Samorodnitsky. Testing basic boolean formulae. SIAM J. Disc. Math., 16:20-46, 2002.
13. D. Štefankovič. Fourier transform in computer science. Master's thesis, University of Chicago, 2000.
14. A. Terras. Fourier Analysis on Finite Groups and Applications. Cambridge University Press, Cambridge, UK, 1999.
15. K. Verbeurgt. Learning DNF under the uniform distribution in quasi-polynomial time. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 314-326, 1990.
16. A. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proceedings of the Seventeenth Annual Symposium on Foundations of Computer Science, pages 222-227, 1977.