Skip to main content
Conference Proceedings

The order encoding: From tractable CSP to tractable SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6695 LNCS 371-372
DOI: 10.1007/978-3-642-21581-0_34
28Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many mathematical and practical problems can be expressed as constraint satisfaction problems (CSPs). The general CSP is known to be NP-complete, but many different conditions have been identified which are sufficient to ensure that classes of instances satisfying those conditions are tractable, that is, solvable in polynomial time [1,2,3,4,7]. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Petke, J., & Jeavons, P. (2011). The order encoding: From tractable CSP to tractable SAT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6695 LNCS, pp. 371–372). https://doi.org/10.1007/978-3-642-21581-0_34

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