3. Boolean Constraint Satisfaction Problems

Emerging

1
Citations
0
Refs
2001
Year
Search Works
Work Details
  • DOI 10.1137/1.9780898718546.ch3
  • OpenAlex ID W2476928253
  • Type Book-chapter
  • Language EN
  • Published 01 Jan 2001
  • Pages 19–23
  • Source Society for Industrial and Applied Mathe…
  • Publisher Society for Industrial and Applied …
  • Added 23 Aug 2016
  • Updated 10 Oct 2026
External Links
OpenAlex Record DOI Resolver
MENU
0

3. Boolean Constraint Satisfaction Problems

Book-chapter 2001 EN

We introduce Boolean constraint satisfaction problems in this chapter. We define several classes of constraint satisfaction problems, corresponding to the different classes NP, PSPACE, NC, #P, and NPO. The unifying concept behind all the classes, and all problems within a class, is the presentation of the input instances. An instance of any problem in any one of the classes has the same canonical…

1

Citations

0

References

0

Authors

0.00

FWCI

Topics
Keywords
Related Works
10

Data: OpenAlex