Learning sparse multivariate polynomials over a field with queries and counterexamples.

DOI10.1006/jcss.1996.0017zbMath1152.68453OpenAlexW4255348961WikidataQ124883319 ScholiaQ124883319MaRDI QIDQ960464

Linda M. Sellie, Robert E. Schapire

Publication date: 21 December 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9410e9dae43d3ea1771512a99af7406b2e0488d2

zbMATH Keywords

learning a polynomial

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (12)

On learning multivariate polynomials under the uniform distribution ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Almost optimal proper learning and testing polynomials ⋮ Unnamed Item ⋮ Efficiently testing sparse \(\text{GF}(2)\) polynomials ⋮ Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in ⋮ Learning Read-Constant Polynomials of Constant Degree Modulo Composites ⋮ Learning read-constant polynomials of constant degree modulo composites ⋮ Testing by Implicit Learning: A Brief Survey ⋮ Cryptographic hardness for learning intersections of halfspaces ⋮ DNF are teachable in the average case ⋮ The query complexity of finding local minima in the lattice

This page was built for publication: Learning sparse multivariate polynomials over a field with queries and counterexamples.