Computational Complexity of Solving Equation Systems
Broniek, Przemyslaw
Produktnummer:
18ac710a6e84784576b971fd9cb0cb3a96
| Autor: | Broniek, Przemyslaw |
|---|---|
| Themengebiete: | algorithm analysis and problem complexity four-element 2-valued algebras generic operations with few values open problems reducing CSP to SYSTERMSAT over unary algebras simplification algorithm three-element algebras unary algebras width and complexity of unary algebras |
| Veröffentlichungsdatum: | 05.08.2015 |
| EAN: | 9783319217499 |
| Sprache: | Englisch |
| Seitenzahl: | 64 |
| Produktart: | Kartoniert / Broschiert |
| Verlag: | Springer International Publishing |
Produktinformationen "Computational Complexity of Solving Equation Systems"
This volume considers the computational complexity of determining whether a system of equations over a fixed algebra A has a solution. It examines in detail the two problems this leads to: SysTermSat(A) and SysPolSat(A), in which equations are built out of terms or polynomials, respectively. The book characterizes those algebras for which SysPolSat can be solved in a polynomial time. So far, studies and their outcomes have not covered algebras that generate a variety admitting type 1 in the sense of Tame Congruence Theory. Since unary algebras admit only type 1, this book focuses on these algebras to tackle the main problem. It discusses several aspects of unary algebras and proves that the Constraint Satisfaction Problem for relational structures is polynomially equivalent to SysTermSat over unary algebras. The book’s final chapters discuss partial characterizations, present conclusions, and describe the problems that are still open.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen