On Being Far from Far and on Dual Problems in Property Testing
From MaRDI portal
Publication:2800557
DOI10.1145/2840728.2840732zbMath1334.68106OpenAlexW2286220164MaRDI QIDQ2800557
Publication date: 15 April 2016
Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2840728.2840732
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (2)
This page was built for publication: On Being Far from Far and on Dual Problems in Property Testing