Sciweavers

CSR
2006
Springer
15 years 18 days ago
The Complexity of Equality Constraint Languages
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
Manuel Bodirsky, Jan Kára