Balance Problems for Integer Circuits

@article{Dose2018BalancePF,
  title={Balance Problems for Integer Circuits},
  author={Titus Dose},
  journal={Electron. Colloquium Comput. Complex.},
  year={2018},
  volume={25},
  pages={55}
}
  • Titus Dose
  • Published 2018
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
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… Expand

References

SHOWING 1-10 OF 23 REFERENCES
Balance problems for integer circuits
  • Titus Dose
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2019
Equivalence Problems for Circuits over Sets of Natural Numbers
Integer circuit evaluation is PSPACE-complete
  • Ke Yang
  • Mathematics, Computer Science
  • Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers
  • Titus Dose
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2016
Functions Definable by Arithmetic Circuits
...
1
2
3
...