Balance Problems for Integer Circuits

  title={Balance Problems for Integer Circuits},
  author={Titus Dose},
  booktitle={Electronic Colloquium on Computational Complexity},
  • Titus Dose
  • Published in
    Electronic Colloquium on…
  • Computer Science, Mathematics
  • We investigate the computational complexity of balance problems for {−, ·}-circuits computing finite sets of natural numbers. These problems naturally build on problems for integer expressions and integer circuits studied by Stockmeyer and Meyer (1973), McKenzie and Wagner (2007), and Glaßer et al. (2010). Our work shows that the balance problem for {−, ·}-circuits is undecidable which is the first natural problem for integer circuits or related constraint satisfaction problems that admits only… CONTINUE READING


    Publications referenced by this paper.

    Balance problems for integer circuits

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

    Emptiness Problems for Integer Circuits

    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