Satisfiability of algebraic circuits over sets of natural numbers

DOI10.1016/j.dam.2010.04.001zbMath1194.94206OpenAlexW1967161325MaRDI QIDQ987688

Stephen Travers, Christian Reitwießner, Christian Glaßer, Matthias Waldherr

Publication date: 13 August 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.04.001

zbMATH Keywords

computational complexitysatisfiability problemscombinatorial integer circuits

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic ⋮ Circuit satisfiability and constraint satisfaction around Skolem arithmetic ⋮ Emptiness problems for integer circuits ⋮ Unnamed Item ⋮ Parsing Boolean grammars over a one-letter alphabet using online convolution ⋮ Emptiness Problems for Integer Circuits ⋮ Balance problems for integer circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The decision problem for exponential diophantine equations
• PRIMES is in P
• Equivalence Problems for Circuits over Sets of Natural Numbers

This page was built for publication: Satisfiability of algebraic circuits over sets of natural numbers