The Power of Depth 2 Circuits over Algebras
From MaRDI portal
Publication:2920144
DOI10.4230/LIPIcs.FSTTCS.2009.2333zbMath1248.68262MaRDI QIDQ2920144
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
Publication date: 24 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_e30d.html
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68W20: Randomized algorithms
Related Items
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits, On the power of algebraic branching programs of width two, Arithmetic Circuits: A Chasm at Depth 3, On the Power of Algebraic Branching Programs of Width Two