Skip to main content
Conference Proceedings

The structure of tractable constraint satisfaction problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4162 LNCS 58-72
DOI: 10.1007/11821069_5
36Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a survey of recent results on the complexity of constraint satisfaction problems. Our main emphasis is on tractable structural restrictions. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Grohe, M. (2006). The structure of tractable constraint satisfaction problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4162 LNCS, pp. 58–72). Springer Verlag. https://doi.org/10.1007/11821069_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free