On the power of algebraic branching programs of width two
From MaRDI portal
Publication:260398
DOI10.1007/s00037-015-0114-7zbMath1348.68061OpenAlexW2922071740MaRDI QIDQ260398
Fengming Wang, Eric W. Allender
Publication date: 21 March 2016
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-015-0114-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A note on VNP-completeness and border complexity ⋮ On the closures of monotone algebraic classes and variants of the determinant ⋮ Unnamed Item
Cites Work
- Resource trade-offs in syntactically multilinear arithmetic circuits
- Nondeterministic \(NC^1\) computation
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- Small space analogues of Valiant's classes and the limitations of skew formulas
- The Power of Depth 2 Circuits over Algebras
- Computing Algebraic Formulas Using a Constant Number of Registers
- Word Problems Solvable in Logspace
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the power of algebraic branching programs of width two
