• DOI:10.1007/978-3-540-74240-1_12
Corpus ID: 11478251

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

View via Publisher

Save to Library

Create Alert

Cite

Launch Research Feed

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