Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers

@inproceedings{Dose2016ComplexityOC,
  title={Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers},
  author={Titus Dose},
  booktitle={Electron. Colloquium Comput. Complex.},
  year={2016}
}
  • Titus Dose
  • Published in
    Electron. Colloquium Comput…
    2016
  • Mathematics, Computer Science
We study the computational complexity of constraint satisfaction problems that are based on integer expressions and algebraic circuits. On input of a finite set of variables and a finite set of constraints the question is whether the variables can be mapped onto finite subsets of N (resp., finite intervals over N) such that all constraints are satisfied. According to the operations allowed in the constraints, the complexity varies over a wide range of complexity classes such as L, P, NP, PSPACE… Expand
Balance problems for integer circuits
  • Titus Dose
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2019
Balance Problems for Integer Circuits
  • Titus Dose
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2018
Emptiness problems for integer circuits
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

References

SHOWING 1-10 OF 24 REFERENCES
Complexity of Equations over Sets of Natural Numbers
Generation Problems
On equations over sets of integers
Univariate Equations Over Sets of Natural Numbers
...
1
2
3
...