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

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Petke, J., & Jeavons, P. (2011). 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), 6695 LNCS, 371–372.

MLA Style

Petke, J., and P. Jeavons. “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), vol. 6695 LNCS, 2011, pp. 371–72.

Chicago Style

Petke, J, and P Jeavons. 2011. “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) 6695 LNCS: 371–72.
Share
Print

Access Document

Publisher copy:: 10.1007/978-3-642-21581-0_34

Authors

+ Petke, J More by this author

Role:: Author

+ Jeavons, P More by this author

Role:: Author

Journal:: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) More from this journal
Volume:: 6695 LNCS
Pages:: 371-372
Publication date:: 2011-01-01
DOI:: 10.1007/978-3-642-21581-0_34
EISSN:: 1611-3349
ISSN:: 0302-9743

Language:: English
Pubs id:: pubs:328780
UUID:: uuid:33139ffa-71ab-4d22-8968-c12f65a1cbc9
Local pid:: pubs:328780
Source identifiers:: 328780
Deposit date:: 2013-11-17

Terms of use

Copyright date:: 2011

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About 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