Pages that link to "Item:Q976069"
From MaRDI portal
The following pages link to Deterministically testing sparse polynomial identities of unbounded degree (Q976069):
Displaying 13 items.
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- The ideal membership problem and polynomial identity testing (Q963063) (← links)
- A polynomial-time dependence test for determining integer-valued solutions in multi-dimensional arrays under variable bounds (Q1777451) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Binomiality testing and computing sparse polynomials via witness sets (Q2155632) (← links)
- Sparse polynomial interpolation based on derivatives (Q2156377) (← links)
- Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix (Q2985828) (← links)
- Randomness efficient testing of sparse black box identities of unbounded degree over the reals (Q3113719) (← links)
- On some computations on sparse polynomials (Q5002654) (← links)
- Algebraic independence in positive characteristic: A $p$-adic calculus (Q5420121) (← links)
- (Q6084351) (← links)
