Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
From MaRDI portal
Publication:2875192
DOI10.1145/1806689.1806779zbMath1293.90040OpenAlexW2017779408MaRDI QIDQ2875192
Partha Mukhopadhyay, Zohar S. Karnin, Amir Shpilka, Ilya Volkovich
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806779
Related Items (5)
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In ⋮ Exact learning from an honest teacher that answers membership queries ⋮ On enumerating monomials and other combinatorial structures by polynomial interpolation ⋮ Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in ⋮ Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
This page was built for publication: Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
