Balance Problems for Integer Circuits

@inproceedings{Dose2018BalancePF,
  title={Balance Problems for Integer Circuits},
  author={Titus Dose},
  booktitle={Electronic Colloquium on Computational Complexity},
  year={2018}
}
  • Titus Dose
  • Published in
    Electronic Colloquium on…
     2018
  • 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
    View PDF

    References

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

    Balance problems for integer circuits

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

    Emptiness Problems for Integer Circuits

    Equivalence Problems for Circuits over Sets of Natural Numbers

    VIEW 1 EXCERPT

    Satisfiability of algebraic circuits over sets of natural numbers

    Integer circuit evaluation is PSPACE-complete

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

    The Complexity of Membership Problems for Circuits over Sets of Integers

    The Complexity of Membership Problems for Circuits over Sets of Positive Numbers

    Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

    Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers

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

    Functions Definable by Arithmetic Circuits