On Lower Bounds for Constant Width Arithmetic Circuits

DOI10.1007/978-3-642-10631-6_65zbMath1273.68144OpenAlexW2117770114MaRDI QIDQ3652250

V. Arvind, Pushkar S. Joglekar, Srikanth Srinivasan

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_65

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Balancing bounded treewidth circuits ⋮ Small space analogues of Valiant's classes and the limitations of skew formulas

This page was built for publication: On Lower Bounds for Constant Width Arithmetic Circuits