Pages that link to "Item:Q1178687"

The following pages link to On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687):

Displaying 19 items.

• On learning multivariate polynomials under the uniform distribution (Q290214) (← links)
• A local decision test for sparse polynomials (Q407596) (← links)
• Sparse interpolation of multivariate rational functions (Q633622) (← links)
• Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
• Counting curves and their projections (Q677992) (← links)
• Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
• The complexity of sparse polynomial interpolation over finite fields (Q1320441) (← 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 interpolation problem for \(k\)-sparse polynomials and character sums (Q1814140) (← links)
• The query complexity of finding local minima in the lattice (Q1854471) (← links)
• Sparse shifts for univariate polynomials (Q1924546) (← links)
• A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
• Learning algebraic decompositions using Prony structures (Q2182612) (← links)
• Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
• Zero testing and equation solving for sparse polynomials on rectangular domains (Q6191070) (← links)
• Orders of Gauss periods in finite fields (Q6487964) (← links)