On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds

DOI10.1007/978-3-540-70918-3_12zbMath1186.68208OpenAlexW1487480175MaRDI QIDQ3590929

Peter Bürgisser

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_12

Mathematics Subject Classification ID

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

Related Items (2)

The complexity of two problems on arithmetic circuits ⋮ Kolmogorov Complexity Theory over the Reals

This page was built for publication: On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds