On the power of algebraic branching programs of width two
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3916181 (Why is no real title available?)
- scientific article; zbMATH DE number 1405642 (Why is no real title available?)
- scientific article; zbMATH DE number 2196509 (Why is no real title available?)
- Computing Algebraic Formulas Using a Constant Number of Registers
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- Nondeterministic NC^1 computation
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- Resource trade-offs in syntactically multilinear arithmetic circuits
- Small space analogues of Valiant's classes and the limitations of skew formulas
- The power of depth 2 circuits over algebras
- Word Problems Solvable in Logspace
Cited in
(8)- On Algebraic Branching Programs of Small Width
- On the power of algebraic branching programs of width two
- On the closures of monotone algebraic classes and variants of the determinant
- A note on VNP-completeness and border complexity
- On the closures of monotone algebraic classes and variants of the determinant
- On algebraic branching programs of small width
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- scientific article; zbMATH DE number 7561749 (Why is no real title available?)
This page was built for publication: On the power of algebraic branching programs of width two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260398)
