Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.

DOI10.4230/LIPIcs.MFCS.2016.32zbMath1398.68227OpenAlexW2547722307MaRDI QIDQ4608591

Titus Dose

Publication date: 21 March 2018

Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2016.html#Dose16

zbMATH Keywords

computational complexityconstraint satisfaction problemsinteger expressions and circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic ⋮ Circuit satisfiability and constraint satisfaction around Skolem arithmetic ⋮ Emptiness problems for integer circuits ⋮ Unnamed Item ⋮ Emptiness Problems for Integer Circuits ⋮ Balance problems for integer circuits

This page was built for publication: Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.