Attribute estimation and testing quasi-symmetry

Information Processing Letters

Volumn 109, Issue 4, 2009, Pages 233-237

  Majewski, Krzysztof ^a   Pippenger, Nicholas ^b  

^a UNIVERSITY OF OSLO   (Norway)

^b HARVEY MUDD COLLEGE   (United States)

Author keywords

Boolean functions; Property testing; Randomized algorithms

Indexed keywords

FUNCTIONS; GATES (TRANSISTOR); PROBABILITY; PROBABILITY DENSITY FUNCTION; RANDOM ERRORS; RANDOM PROCESSES;

ERROR PROBABILITIES; HIGH PROBABILITIES; INFORMATION CONCERNING; PROPERTY TESTING; RANDOM SAMPLINGS; RANDOMIZED ALGORITHMS; SYMMETRIC FUNCTIONS; SYMMETRY TESTS; TESTING PARADIGMS;

BOOLEAN FUNCTIONS;

EID: 57749101099     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.10.011     Document Type: Article

References (10)

1. Damschke P. Adaptive versus nonadaptive attribute-efficient learning. Proc. ACM Symp. Theory of Computing 30 (1998) 590-596
2. Fischer E., Kindler G., Ron D., Safra S., and Samoridnitsky A. Testing juntas. Proc. IEEE Symp. on Foundations of Computer Science 43 (2002) 103-112
3. Goldreich O., Goldwasser S., Lehman E., and Ron D. Testing monotonicity. Proc. IEEE Symp. on Foundations of Computer Science 39 (1998) 426-435
4. Goldreich O., Goldwasser S., Lehman E., Ron D., and Samoridnitsky A. Testing monotonicity. Combinatorica 20 (2000) 301-337
5. Goldreich O., Goldwasser S., and Ron D. Property testing and its connection to learning and approximation. J. ACM 45 (1998) 653-750
6. D. Guijarro, J. Tarui, T. Tsukiji, Finding relevant variables in PAC model with membership queries, in: O. Watanabi, T. Yokomori (Eds.), Algorithmic Learning Theory, 10, 1999, pp. 313-322
7. Parnas M., Ron D., and Samoridnitsky A. Proclaiming dictators and juntas or testing Boolean formulae. In: Goemans M., Jansen K., Rolim J.D.P., and Treviasan L. (Eds). Lecture Notes in Computer Science. Approximation, Randomization, and Combinatorial Optimization vol. 2129 (2001), Springer-Verlag, Berlin 273-284
8. Parnas M., Ron D., and Samoridnitsky A. Proclaiming dictators and juntas or testing Boolean formulae. in: Electronic Colloq. on Computational Complexity, no. 63. http://eccc.uni-trier.de/eccc/ 2001, 31 p
9. Parnas M., Ron D., and Samoridnitsky A. Testing basic Boolean formulae. in: Electronic Colloq. on Computational Complexity, no. 63, rev. 1. http://eccc.uni-trier.de/eccc/ 2001, 29 p
10. Rubinfeld R., and Sudan M. Robust characterizations of polynomials with applications to program testing. SIAM J. Computing 25 2 (1996) 252-271