Learning polynomials with queries: The highly noisy case
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1303541
- On learning multivariate polynomials under the uniform distribution
- Learning sparse polynomial functions
- Hardness of Reconstructing Multivariate Polynomials over Finite Fields
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
Cited in
(30)- Improvements on the Johnson bound for Reed-Solomon codes
- A polynomial-time algorithm for learning noisy linear threshold functions
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- Can we locally compute sparse connected subgraphs?
- Noisy interpolating sets for low-degree polynomials
- Three XOR-lemmas -- an exposition
- Computational Randomness from Generalized Hardcore Sets
- Polynomial fitting of data streams with applications to codeword testing
- Making polynomials robust to noise
- Public-key encryption schemes with auxiliary inputs
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
- Attacks on statistical databases: the highly noisy case
- NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
- Some recent results on local testing of sparse linear codes
- scientific article; zbMATH DE number 1453041 (Why is no real title available?)
- scientific article; zbMATH DE number 7310074 (Why is no real title available?)
- Extracting Computational Entropy and Learning Noisy Linear Functions
- Algorithmic regularity for polynomials and applications
- Learning sparse polynomial functions
- Making polynomials robust to noise
- Quadratic Goldreich-Levin theorems
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Fitting algebraic curves to noisy data
- Erasures versus errors in local decoding and property testing
- Collision-resistance from multi-collision-resistance
- Collision Resistance from Multi-collision Resistance
- Locally computing edge orientations
- Structural testing with homomorphic encryption
- List decoding of the first-order binary Reed-Muller codes
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
This page was built for publication: Learning polynomials with queries: The highly noisy case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706184)
