Local correction of juntas
From MaRDI portal
Publication:437678
DOI10.1016/j.ipl.2011.12.005zbMath1242.94044arXiv1109.3639OpenAlexW2964215529MaRDI QIDQ437678
Publication date: 18 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.3639
Analysis of algorithms and problem complexity (68Q25) Other types of codes (94B60) Boolean functions (06E30) Randomized algorithms (68W20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Testing juntas
- Self-testing/correcting with applications to numerical problems
- A lower bound for testing juntas
- Testing Reed–Muller Codes
- Testing Boolean Function Isomorphism
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Testing Basic Boolean Formulae
- Testing juntas nearly optimally
- Locally Decodable Codes
This page was built for publication: Local correction of juntas