Balance problems for integer circuits

@article{Dose2019BalancePF,
  title={Balance problems for integer circuits},
  author={Titus Dose},
  journal={Theor. Comput. Sci.},
  year={2019},
  volume={799},
  pages={124-139}
}
  • Titus Dose
  • Published 2019
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
Abstract 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 Glaser 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… Expand
1 Citations

Topics from this paper

Balance Problems for Integer Circuits
  • Titus Dose
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2018

References

SHOWING 1-10 OF 19 REFERENCES
The complexity of membership problems for circuits over sets of integers
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
Integer Circuit Evaluation Is PSPACE-Complete
  • Ke Yang
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2001
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
...