Pages that link to "Item:Q1351508"
From MaRDI portal
The following pages link to On some approximation problems concerning sparse polynomials over finite fields (Q1351508):
Displaying 13 items.
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870) (← links)
- On the zeros of Boolean polynomials (Q1571257) (← links)
- Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products (Q2065446) (← links)
- Sparse univariate polynomials with many roots over finite fields (Q2363328) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- On the number of distinct roots of a lacunary polynomial over finite fields (Q2662052) (← links)
- Erratum: ``On the heuristic of approximating polynomials over finite fields by random mappings'' (Q2828375) (← links)
- Sparsity of the intersection of polynomial images of an interval (Q3190543) (← links)
- Approximating the Number of Zeroes of a GF[2] Polynomial (Q4033769) (← links)
