Pages that link to "Item:Q3359132"
From MaRDI portal
The following pages link to Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$ (Q3359132):
Displayed 10 items.
- On learning multivariate polynomials under the uniform distribution (Q290214) (← links)
- Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810) (← links)
- DNF are teachable in the average case (Q1009216) (← links)
- On interpolating arithmetic read-once formulas with exponentiation (Q1267719) (← links)
- The complexity of sparse polynomial interpolation over finite fields (Q1320441) (← links)
- Simple learning algorithms using divide and conquer (Q1355381) (← links)
- Exact learning of linear combinations of monotone terms from function value queries (Q1367523) (← links)
- Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- (Q5009555) (← links)