Pages that link to "Item:Q2706184"
From MaRDI portal
The following pages link to Learning Polynomials with Queries: The Highly Noisy Case (Q2706184):
Displaying 16 items.
- Attacks on statistical databases: the highly noisy case (Q396611) (← links)
- List decoding of the first-order binary Reed-Muller codes (Q927477) (← links)
- Improvements on the Johnson bound for Reed-Solomon codes (Q1028479) (← links)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Three XOR-Lemmas — An Exposition (Q3088188) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Public-Key Encryption Schemes with Auxiliary Inputs (Q3408205) (← links)
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$ (Q3535361) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- Some Recent Results on Local Testing of Sparse Linear Codes (Q4933384) (← links)
- (Q5150420) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
- Collision Resistance from Multi-collision Resistance (Q6489330) (← links)
