Jacobian hits circuits
From MaRDI portal
Publication:5415504
DOI10.1145/2213977.2214033zbMath1286.94115arXiv1111.0582OpenAlexW2169939595MaRDI QIDQ5415504
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena, Manindra Agrawal
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.0582
Related Items
Subexponential size hitting sets for bounded depth multilinear formulas, Monomials, multilinearity and identity testing in simple read-restricted circuits, On enumerating monomials and other combinatorial structures by polynomial interpolation, Multi-\(k\)-ic depth three circuit lower bound, Unnamed Item, Unnamed Item, Deterministic polynomial identity tests for multilinear bounded-read formulae, An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas, Read-once polynomial identity testing, Algebraic independence in positive characteristic: A $p$-adic calculus, Depth-4 Identity Testing and Noether’s Normalization Lemma, Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits, Unnamed Item, A Selection of Lower Bounds for Arithmetic Circuits, Improved hitting set for orbit of ROABPs, Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
