Pages that link to "Item:Q654006"
From MaRDI portal
The following pages link to Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006):
Displayed 17 items.
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Towards dimension expanders over finite fields (Q654002) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← 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)
- Algebraic Independence and Blackbox Identity Testing (Q3012915) (← links)
- (Q4612482) (← links)
- (Q5121892) (← links)
- Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Depth-4 Identity Testing and Noether’s Normalization Lemma (Q5740194) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond (Q6172035) (← links)