Distribution-Free Testing Lower Bounds for Basic Boolean Functions
DOI10.1007/978-3-540-74208-1_36zbMath1171.68726OpenAlexW2123346810MaRDI QIDQ3603489
Dana Glasner, Rocco A. Servedio
Publication date: 17 February 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_36
Computational learning theory (68Q32) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Distribution-Free Testing Lower Bounds for Basic Boolean Functions
