Pages that link to "Item:Q960464"
From MaRDI portal
The following pages link to Learning sparse multivariate polynomials over a field with queries and counterexamples. (Q960464):
Displaying 16 items.
- On learning multivariate polynomials under the uniform distribution (Q290214) (← links)
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- DNF are teachable in the average case (Q1009216) (← links)
- Learning matrix functions over rings (Q1271196) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- Multiaffine polynomials over a finite field (Q2064385) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Learning multivariate functions with low-dimensional structures using polynomial bases (Q2667104) (← links)
- Learning polynomials with queries: The highly noisy case (Q2706184) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- Testing by Implicit Learning: A Brief Survey (Q4933369) (← links)
- (Q5009555) (← links)
- Learning Theory and Kernel Machines (Q5305870) (← links)
