Complexity of Constraint Satisfaction: Computational complexity theory, Constraint satisfaction, Constraint satisfaction problem, NP- complete, P (complexity), 2-satisfiability - Couverture souple

 
9786133708341: Complexity of Constraint Satisfaction: Computational complexity theory, Constraint satisfaction, Constraint satisfaction problem, NP- complete, P (complexity), 2-satisfiability
Couverture souple
ISBN 10 : 6133708344 ISBN 13 : 9786133708341
Editeur : Alphascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction problems on finite domains. Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general. Research has shown a number of polynomial-time subcases, mostly obtained by restricting either the allowed domains or constraints or the way constraints can be placed over the variables. Research has also established relationship of the constraint satisfaction problem with problems in other areas such as finite model theory and databases

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Alphascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
6133708344
ISBN 13 
9786133708341
Reliure
Broché
Nombre de pages
72
Éditeur
Miller Frederic P., Vandome Agnes F., McBrewster John
Coordonnées du fabricant
non disponible
Personne responsable
non disponible