Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
From MaRDI portal
Publication:2875192
DOI10.1145/1806689.1806779zbMATH Open1293.90040OpenAlexW2017779408MaRDI QIDQ2875192FDOQ2875192
Authors: Zohar S. Karnin, Partha Mukhopadhyay, 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
Recommendations
- Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
- scientific article; zbMATH DE number 7711593
- Black-box identity testing of depth-4 multilinear circuits
- Black-box identity testing of depth-4 multilinear circuits
- Blackbox identity testing for bounded top-fanin depth-3 circuits: the field doesn't matter
- Blackbox identity testing for bounded top fanin depth-3 circuits, the field doesn't matter
- On constant depth circuits parameterized by degree: identity testing and depth reduction
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- From sylvester-gallai configurations to rank bounds
- Deterministic polynomial identity tests for multilinear bounded-read formulae
Cited In (11)
- Diagonal Circuit Identity Testing and Lower Bounds
- Exact learning from an honest teacher that answers membership queries
- 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
- Reconstruction of depth-4 multilinear circuits with top fan-in 2
- Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
- From sylvester-gallai configurations to rank bounds
- The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
- Depth-4 identity testing and Noether's normalization lemma
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- Black-box identity testing of depth-4 multilinear circuits
This page was built for publication: Deterministic identity testing of depth-\(4\) multilinear circuits with bounded top fan-in
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875192)
