scientific article; zbMATH DE number 6829280
From MaRDI portal
Publication:4601832
DOI10.4230/LIPIcs.CCC.2015.264zbMath1387.68126MaRDI QIDQ4601832
No author found.
Publication date: 24 January 2018
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)
Related Items (4)
An adaptivity hierarchy theorem for property testing ⋮ Approximating the distance to monotonicity of Boolean functions ⋮ Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces ⋮ Unnamed Item
This page was built for publication:
