scientific article
From MaRDI portal
DOI10.4086/toc.2009.v005a010zbMath1213.68415OpenAlexW2568354864MaRDI QIDQ3002810
Dana Glasner, Rocco A. Servedio
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2009.v005a010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Theory of computing (68Q99)
Related Items
Testing graphs against an unknown distribution, Improved approximation of linear threshold functions, On one-sided testing affine subspaces, Almost Optimal Testers for Concise Representations., Almost optimal distribution-free junta testing