An almost optimal rank bound for depth-3 identities
From MaRDI portal
Publication:2999861
Recommendations
- Polynomial identity testing for depth 3 circuits
- From sylvester-gallai configurations to rank bounds
- 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
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
Cited in
(13)- Read-once polynomial identity testing
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- Improved hitting set for orbit of ROABPs
- Linear independence, alternants, and applications
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
- Deterministic polynomial identity tests for multilinear bounded-read formulae
- Improved Bounds for Reduction to Depth 4 and Depth 3
- scientific article; zbMATH DE number 7009617 (Why is no real title available?)
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- Lower bounds for Clifford indices in rank three
- Algebraic independence and blackbox identity testing
This page was built for publication: An almost optimal rank bound for depth-3 identities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999861)
