Pages that link to "Item:Q5175971"
From MaRDI portal
The following pages link to Randomness efficient identity testing of multivariate polynomials (Q5175971):
Displayed 15 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- Arithmetic Circuits, Monomial Algebras and Finite Automata (Q3182914) (← links)
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size (Q3541802) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Depth-4 Identity Testing and Noether’s Normalization Lemma (Q5740194) (← links)