Satisfiability of algebraic circuits over sets of natural numbers

Authors:
Christian Glaíer;Christian Reitwieíner;Stephen Travers;Matthias Waldherr
Affiliations:
Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Germany;Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Germany;Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Germany;Theoretische Informatik, Julius-Maximilians-Universität Würzburg, Germany
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 6
Cited 1

The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract)

Proceedings of the Mathematical Foundations of Computer Science 1984
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Integer Circuit Evaluation is PSPACE-Complete

COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Equivalence problems for circuits over sets of natural numbers

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Parsing Boolean grammars over a one-letter alphabet using online convolution

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

Abstract

We investigate the complexity of satisfiability problems for {@?,@?,^-,+,x}-circuits computing sets of natural numbers. These problems are a natural generalization of membership problems for expressions and circuits studied by Stockmeyer and Meyer (1973) [10] and McKenzie and Wagner (2003) [8]. Our work shows that satisfiability problems capture a wide range of complexity classes such as NL, P, NP, PSPACE, and beyond. We show that in several cases, satisfiability problems are harder than membership problems. In particular, we prove that testing satisfiability for {@?,+,x}-circuits is already undecidable. In contrast to this, the satisfiability for {@?,+,x}-circuits is decidable in PSPACE.