The following pages link to (Q4471369):
Displaying 13 items.
- Read-once polynomial identity testing (Q496300) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- A deterministic test for permutation polynomials (Q1207336) (← links)
- A polynomial-time dependence test for determining integer-valued solutions in multi-dimensional arrays under variable bounds (Q1777451) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
- Polynomial identity testing for depth 3 circuits (Q2472430) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- On some computations on sparse polynomials (Q5002654) (← links)
- Towards blackbox identity testing of log-variate circuits (Q5002729) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
- The Monomial Ideal Membership Problem and Polynomial Identity Testing (Q5387813) (← links)