Blackbox Polynomial Identity Testing for Depth 3 Circuits
From MaRDI portal
Cited in
(24)- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
- Improved hitting set for orbit of ROABPs
- Exact learning from an honest teacher that answers membership queries
- Jacobian hits circuits: hitting sets, lower bounds for depth-D occur-k formulas and depth-3 transcendence degree-k circuits
- Improved rank bounds for design matrices and a new proof of Kelly's theorem
- Recent results on polynomial identity testing
- Subexponential size hitting sets for bounded depth multilinear formulas
- scientific article; zbMATH DE number 7009617 (Why is no real title available?)
- Read-once polynomial identity testing
- Lower bounds for 2-query LCCs over large alphabet
- A generalized sylvester-gallai type theorem for quadratic polynomials
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- Depth-4 identity testing and Noether's normalization lemma
- Interactions of computational complexity theory and mathematics
- Linear independence, alternants, and applications
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Linear independence, alternants and applications
- Tensor reconstruction beyond constant rank
- Reconstruction of depth-4 multilinear circuits
- Towards identity testing for sums of products of Read-once and multilinear bounded-Read formulae
- Hitting sets for orbits of circuit classes and polynomial families
- Uniform bounds on product Sylvester-Gallai configurations
- Deterministic polynomial identity tests for multilinear bounded-read formulae
This page was built for publication: Blackbox Polynomial Identity Testing for Depth 3 Circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171176)
