Schaefer's Dichotomy Theorem: Computational Complexity Theory, Computer Science, NP- Complete - Softcover

 
9786131171598: Schaefer's Dichotomy Theorem: Computational Complexity Theory, Computer Science, NP- Complete
Softcover
ISBN 10: 6131171599 ISBN 13: 9786131171598
Verlag: OmniScriptum, 2010

Inhaltsangabe

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, a branch of computer science, Schaefer''s theorem states necessary and sufficient conditions under which a finite set S of Boolean relations yields polynomial-time or NP-complete problems when the relations of S are used to constrain some of the propositional variables. More precisely, Schaefer defines a decision problem which he calls the Generalized Satisfiability problem for S (denoted SAT(S)). The problem is to determine whether the given formula is satisfiable, in other words if the variables can be assigned values such that they satisfy all the constraints. Special cases of SAT(S) include the variants of Boolean satisfiability problem and the problem can also be viewed as a constraint satisfaction problem over the Boolean domain.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, a branch of computer science, Schaefer''s theorem states necessary and sufficient conditions under which a finite set S of Boolean relations yields polynomial-time or NP-complete problems when the relations of S are used to constrain some of the propositional variables. More precisely, Schaefer defines a decision problem which he calls the Generalized Satisfiability problem for S (denoted SAT(S)). The problem is to determine whether the given formula is satisfiable, in other words if the variables can be assigned values such that they satisfy all the constraints. Special cases of SAT(S) include the variants of Boolean satisfiability problem and the problem can also be viewed as a constraint satisfaction problem over the Boolean domain.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
OmniScriptum
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6131171599
ISBN 13 
9786131171598
Einband
Tapa blanda
Anzahl der Seiten
80
Herausgeber
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar