Pages that link to "Item:Q2034402"
From MaRDI portal
The following pages link to An improved algorithm for learning sparse parities in the presence of noise (Q2034402):
Displaying 8 items.
- On the hardness of sparsely learning parity with noise (Q1616883) (← links)
- On the robustness of learning parity with noise (Q1989525) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401) (← links)
- An improved analysis of the ER-SpUD dictionary learning algorithm (Q4598183) (← links)
- On the hardness of learning sparse parities (Q4606280) (← links)
- Time-space hardness of learning sparse parities (Q4978047) (← links)
- Improved learning of \(k\)-parities (Q5916259) (← links)