Journal article icon

Journal article

The order encoding: From tractable CSP to tractable SAT

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.

Actions


Access Document


Authors


Journal:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume:
6695 LNCS
Pages:
371-372
Publication date:
2011-01-01
DOI:
EISSN:
1611-3349
ISSN:
0302-9743
URN:
uuid:33139ffa-71ab-4d22-8968-c12f65a1cbc9
Source identifiers:
328780
Local pid:
pubs:328780
Language:
English

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP