Computational Complexity of Constraint Satisfaction

DOI10.1007/978-3-540-73001-9_80zbMath1151.68431OpenAlexW1518573530MaRDI QIDQ5425380

Heribert Vollmer

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_80

zbMATH Keywords

computational complexityGalois connectionpolymorphismcloneconstraint satisfactionsatisfiability problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Applications of universal algebra in computer science (08A70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?

This page was built for publication: Computational Complexity of Constraint Satisfaction