The complexity of membership problems for circuits over sets of integers

@article{Travers2006TheCO,
  title={The complexity of membership problems for circuits over sets of integers},
  author={Stephen D. Travers},
  journal={Theor. Comput. Sci.},
  year={2006},
  volume={369},
  pages={211-229}
}
We investigate the complexity of membership problems for {∪,∩, ̄ , +,×}-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

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

The complexity of problems concerning graphs with regularities

  • K. W. Wagner
  • Proceedings 11th Mathematical Foundations of…
  • 1984
Highly Influential
12 Excerpts

Bemerkungen zu ganzzahligen Ausdrücken

  • H. Petersen
  • Private Communication
  • 2004

Proceedings 15th Conference on Computational Complexity

  • K. Yang, Integer circuit evaluation is PSPACE-complete
  • pp. 204–211,
  • 2000
1 Excerpt

The complexity of algorithmic problems in succinct instances

  • J. L. Balcázar, A. Lozano, J. Torán
  • Computer Science, Plenum, New York
  • 1992

Similar Papers

Loading similar papers…