scientific article
From MaRDI portal
Publication:2913798
DOI10.4086/toc.2011.v007a011zbMath1247.68111OpenAlexW2186390088MaRDI QIDQ2913798
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2011.v007a011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (4)
Testing graphs against an unknown distribution ⋮ On one-sided testing affine subspaces ⋮ Almost Optimal Testers for Concise Representations. ⋮ Almost optimal distribution-free junta testing
This page was built for publication: