Constraint Satisfaction Problems

Bernd Schröder
Additional contact information
Bernd Schröder: University of Southern Mississippi, Department of Mathematics

Chapter Chapter 5 in Ordered Sets, 2016, pp 113-153 from Springer

Abstract: Abstract When proving theorems, we have a luxury that is so fundamental, we often take it for granted: If we need to work with an object, we say “let x be ⟨ $$\langle$$ the object in question ⟩ $$\rangle$$ ” and we move on with the proof. Especially in the finite setting it is obvious that, given enough patience, we should be able to find the object: Simply try out all possibilities and, if there is an object as desired, at least one of them will work. As long as we are not interested in the object itself, this approach is very efficient for developing a theory.

Keywords: Polynomial Time; Constraint Satisfaction Problem; Unary Constraint; Point Property; Local Consistency (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-29788-0_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319297880

DOI: 10.1007/978-3-319-29788-0_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().