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={H. Breunig},
  booktitle={FCT},
  year={2007}
}
  • H. 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… Expand
12 Citations
Equivalence Problems for Circuits over Sets of Natural Numbers
  • 16
  • PDF
Emptiness problems for integer circuits
  • PDF
Emptiness Problems for Integer Circuits
  • 4
  • PDF
Balance problems for integer circuits
  • T. Dose
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2019
  • 1
  • PDF
Balance Problems for Integer Circuits
  • T. Dose
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2018
  • PDF
Complexity of Equations over Sets of Natural Numbers
  • 30
  • PDF
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
  • 7
  • PDF
Constraint Satisfaction Problems around Skolem Arithmetic
  • 2
  • PDF
...
1
2
...

References

SHOWING 1-9 OF 9 REFERENCES
The complexity of membership problems for circuits over sets of integers
  • 24
  • Highly Influential
  • PDF
Integer circuit evaluation is PSPACE-complete
  • K. Yang
  • Mathematics, Computer Science
  • Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
  • 17
Word problems requiring exponential time(Preliminary Report)
  • 823
  • PDF
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
  • 50
Reducing the complexity of reductions
  • 17
Introduction to Circuit Complexity
  • H. Vollmer
  • Computer Science
  • Texts in Theoretical Computer Science An EATCS Series
  • 1999
  • 213
Mathematical Foundations of Computer Science 1984
  • 23
  • PDF