The Complexity of Membership Problems for Circuits over Sets of Integers

@inproceedings{Travers2004TheCO,
  title={The Complexity of Membership Problems for Circuits over Sets of Integers},
  author={Stephen D. Travers},
  booktitle={MFCS},
  year={2004}
}
We investigate the complexity of membership problems for {U, ∩, -, +, x}-circuits computing sets of integers. These problems are a natural modification of the membership problems for circuits computing sets of natural numbers studied by McKenzie and Wagner (2003). We show that there are several membership problems for which the complexity in the case of integers differs significantly from the case of the natural numbers: Testing membership in the subset of integers produced at the output of a… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 18 CITATIONS