On Noise-Tolerant Learning of Sparse Parities and Related Problems
From MaRDI portal
Publication:3093968
DOI10.1007/978-3-642-24412-4_32zbMath1348.68194OpenAlexW1915272284MaRDI QIDQ3093968
Lev Reyzin, Elena Grigorescu, Santosh Vempala
Publication date: 19 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24412-4_32
Related Items (8)
On solving LPN using BKW and variants, Implementation and analysis ⋮ Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time ⋮ BKW meets Fourier new algorithms for LPN with sparse parities ⋮ Solving the learning parity with noise's open question ⋮ Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem ⋮ Improved learning of \(k\)-parities ⋮ An improved algorithm for learning sparse parities in the presence of noise ⋮ Unnamed Item
This page was built for publication: On Noise-Tolerant Learning of Sparse Parities and Related Problems
