The Complexity of Membership Problems for Circuits over Sets of Positive Numbers

@inproceedings{Breunig2007TheCO,
  title={The Complexity of Membership Problems for Circuits over Sets of Positive Numbers},
  author={Hans-Georg Breunig},
  booktitle={FCT},
  year={2007}
}
  • Hans-Georg Breunig
  • Published in FCT 2007
  • Mathematics, Computer Science
  • We investigate the problems of testing membership in the subset of the positive numbers produced at the output of (∪∩,-,+,×) combinational circuits. These problems are a natural modification of those studied by McKenzie and Wagner (2003), where circuits computed sets of natural numbers. It turns out that the missing 0 has strong implications, not only because 0 can be used to test for emptiness. We show that the membership problem for the general case and for (∪∩,+,×) is PSPACE-complete… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-7 OF 7 CITATIONS

    Balance Problems for Integer Circuits

    • Titus Dose
    • Computer Science, Mathematics
    • Electronic Colloquium on Computational Complexity
    • 2018

    Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Emptiness Problems for Integer Circuits

    Constraint Satisfaction Problems around Skolem Arithmetic

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Multiobjective Optimization and Language Equations

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Complexity of Equations over Sets of Natural Numbers

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Equivalence Problems for Circuits over Sets of Natural Numbers

    VIEW 3 EXCERPTS
    CITES BACKGROUND