Example: tourism industry
5 CONSTRAINT SATISFACTION PROBLEMS

5 CONSTRAINT SATISFACTION PROBLEMS

Back to document page

maximum domain size of any variable in a CSP is d, then the number of possible complete assignments is O(dn)—that is, exponential in the number of variables. Finite-domain CSPs BOOLEAN CSPS include Boolean CSPs, whose variables can be either true or false. Boolean CSPs include as special cases some NP-complete problems, such as 3SAT. (See ...

  Satisfaction, Size, Constraints, Constraint satisfaction

Download 5 CONSTRAINT SATISFACTION PROBLEMS


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries