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}
}
  • Stephen D. Travers
  • Published 2006
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 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 [The complexity of membership problems for circuits over sets of natural numbers, Lecture Notes in Computer Science, Vol. 2607, 2003, pp. 571-582]. We show that there are several membership problems for which the complexity in the case of… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Citations

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

    Emptiness problems for integer circuits

    Balance problems for integer circuits

    • Titus Dose
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2019

    Representing Hyper-arithmetical Sets by Equations over Sets of Integers

    VIEW 1 EXCERPT
    CITES METHODS

    Equations over sets of integers with addition only

    Equations over Sets of Natural Numbers with Addition Only

    VIEW 2 EXCERPTS
    CITES METHODS

    Least and Greatest Solutions of Equations over Sets of Integers

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Path Checking for MTL and TPTL over Data Words

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES