Skip to main content
Conference Proceedings

Recent results on the algebraic approach to the CSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5250 LNCS 68-92
DOI: 10.1007/978-3-540-92800-3_4
50Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic framework. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bulatov, A. A., & Valeriote, M. A. (2008). Recent results on the algebraic approach to the CSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5250 LNCS, pp. 68–92). https://doi.org/10.1007/978-3-540-92800-3_4

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