On the border complexity of sums of ROFs
From MaRDI portal
Cites work
- A probabilistic remark on algebraic program testing
- Blackbox identity testing for sum of special ROABPs and its border class
- Complete derandomization of identity testing and reconstruction of read-once formulas
- Demystifying the border of depth-3 algebraic circuits
- Depth-4 identity testing and Noether's normalization lemma
- Derandomization from Algebraic Hardness
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
- Deterministic polynomial identity tests for multilinear bounded-read formulae
- Explicit Noether normalization for simultaneous conjugation via polynomial identity testing
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fixed-parameter debordering of Waring rank
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Geometric complexity theory. V: Efficient algorithms for Noether normalization
- Hardness-randomness tradeoffs for bounded depth arithmetic circuits
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 7471587 (Why is no real title available?)
- scientific article; zbMATH DE number 7561765 (Why is no real title available?)
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
- Interpolating Arithmetic Read-Once Formulas in Parallel
- Learning Arithmetic Read-Once Formulas
- Lower bounds for set-multilinear branching programs
- On interpolating arithmetic read-once formulas with exponentiation
- On matrix multiplication and polynomial identity testing
- On reconstruction and testing of read-once formulas
- Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
- Quasipolynomial-time identity testing of non-commutative and read-once oblivious algebraic branching programs
- Read-once polynomial identity testing
- Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits
- Sums of read-once formulas: how many summands are necessary?
- Über höhere Kongruenzen.
This page was built for publication: On the border complexity of sums of ROFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442724)