Clustering in the Boolean Hypercube in a List Decoding Regime
From MaRDI portal
Publication:5326579
DOI10.1007/978-3-642-39206-1_35zbMath1336.68292OpenAlexW1853606705MaRDI QIDQ5326579
Publication date: 6 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_35
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)
Related Items (2)
Derandomized parallel repetition via structured PCPs ⋮ Towards lower bounds on locally testable codes via density arguments
This page was built for publication: Clustering in the Boolean Hypercube in a List Decoding Regime