Complexity constraint satisfaction computational (1 résultats)

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. The complexity ofconstraint satisfaction is the application of computational complexitytheory on constraint satisfaction. It has mainly been studied fordiscriminating between tractable and intractable classes of constraintsatisfaction problems on finite domains. Solving a constraintsatisfaction problem on a finite domain is an NP-complete problem ingeneral. Research has shown a number of polynomial-time subcases, mostlyobtained by restricting either the allowed domains or constraints or theway constraints can be placed over the variables. Research has alsoestablished relationship of the constraint satisfaction problem withproblems in other areas such as finite model theory and databases.…