Emptiness Problems for Integer Circuits

@inproceedings{Barth2017EmptinessPF,
  title={Emptiness Problems for Integer Circuits},
  author={Dominik Barth and Moritz Beck and Titus Dose and Christian Gla{\ss}er and Larissa Michler and Marc Technau},
  booktitle={MFCS},
  year={2017}
}
  • Dominik Barth, Moritz Beck, +3 authors Marc Technau
  • Published in MFCS 2017
  • Computer Science, Mathematics
  • We study the computational complexity of emptiness problems for circuits over sets of natural numbers with the operations union, intersection, complement, addition, and multiplication. For most settings of allowed operations we precisely characterize the complexity in terms of completeness for classes like NL, NP, and PSPACE. The case where intersection, addition, and multiplication is allowed turns out to be equivalent to the complement of polynomial identity testing (PIT). Our results… CONTINUE READING

    Tables and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    Emptiness problems for integer circuits

    Balance Problems for Integer Circuits

    • Titus Dose
    • Computer Science, Mathematics
    • Electronic Colloquium on Computational Complexity
    • 2018

    Balance problems for integer circuits

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

    Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

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

    The Complexity of Membership Problems for Circuits over Sets of Integers

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    Arithmetic Circuits: A survey of recent results and open questions

    Integer circuit evaluation is PSPACE-complete

    • Ke Yang
    • Computer Science, Mathematics
    • Proceedings 15th Annual IEEE Conference on Computational Complexity
    • 2000

    Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers

    • Titus Dose
    • Computer Science, Mathematics
    • Electronic Colloquium on Computational Complexity
    • 2016