Pages that link to "Item:Q5175971"
From MaRDI portal
The following pages link to Randomness efficient identity testing of multivariate polynomials (Q5175971):
Displayed 7 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)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Arithmetic Circuits, Monomial Algebras and Finite Automata (Q3182914) (← links)
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size (Q3541802) (← links)