Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
From MaRDI portal
Publication:5167788
DOI10.1007/978-3-662-43948-7_62zbMath1360.68481arXiv1312.5978OpenAlexW36301692MaRDI QIDQ5167788
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.5978
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Lower bounds for depth-three arithmetic circuits with small bottom fanin ⋮ On the limits of depth reduction at depth 3 over small finite fields ⋮ An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas ⋮ On the Power of Homogeneous Depth 4 Arithmetic Circuits ⋮ Barriers for Rank Methods in Arithmetic Complexity ⋮ Depth-4 lower bounds, determinantal complexity: a unified approach ⋮ Unnamed Item ⋮ On the Symmetries of and Equivalence Test for Design Polynomials. ⋮ A super-quadratic lower bound for depth four arithmetic circuits ⋮ Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees ⋮ Approaching the Chasm at Depth Four
This page was built for publication: Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
