Functions Definable by Arithmetic Circuits
From MaRDI portal
Publication:3576073
DOI10.1007/978-3-642-03073-4_42zbMath1268.68086MaRDI QIDQ3576073
Ian Pratt-Hartmann, Ivo Duentsch
Publication date: 28 July 2010
Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_42
68Q25: Analysis of algorithms and problem complexity
Related Items
Unnamed Item, Emptiness Problems for Integer Circuits, Circuit satisfiability and constraint satisfaction around Skolem arithmetic, Emptiness problems for integer circuits, Balance problems for integer circuits, Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of membership problems for circuits over sets of integers
- The complexity of membership problems for circuits over sets of natural numbers
- Classes of Predictably Computable Functions
- Equivalence Problems for Circuits over Sets of Natural Numbers
- On the Computational Completeness of Equations over Sets of Natural Numbers
- The bounded arithmetic hierarchy
- Satisfiability of Algebraic Circuits over Sets of Natural Numbers
- On the Recognition of Primes by Automata