Pages that link to "Item:Q2472430"
From MaRDI portal
The following pages link to Polynomial identity testing for depth 3 circuits (Q2472430):
Displayed 17 items.
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← 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)
- Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
- The ideal membership problem and polynomial identity testing (Q963063) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- A case of depth-3 identity testing, sparse factorization and duality (Q1947039) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- Recent Results on Polynomial Identity Testing (Q3007643) (← links)
- (Q5002729) (← links)
- (Q5090939) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- The Monomial Ideal Membership Problem and Polynomial Identity Testing (Q5387813) (← links)
- Depth-4 Identity Testing and Noether’s Normalization Lemma (Q5740194) (← links)