Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness
From MaRDI portal
Publication:4593942
DOI10.1007/3-540-60922-9_27zbMath1379.68157OpenAlexW1604438253MaRDI QIDQ4593942
José D. P. Rolim, Alexander E. Andreev, Andrea E. F. Clementi
Publication date: 16 November 2017
Published in: STACS 96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60922-9_27
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness
