The following pages link to Jacobian hits circuits (Q5415504):
Displaying 16 items.
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Read-once polynomial identity testing (Q496300) (← links)
- Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
- Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- Monomials, multilinearity and identity testing in simple read-restricted circuits (Q2637354) (← links)
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- On some computations on sparse polynomials (Q5002654) (← links)
- Towards blackbox identity testing of log-variate circuits (Q5002729) (← links)
- (Q5121898) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Algebraic independence in positive characteristic: A $p$-adic calculus (Q5420121) (← links)
- Depth-4 Identity Testing and Noether’s Normalization Lemma (Q5740194) (← links)
