|
|
|
|
| LEADER |
02184nmm a2200313 u 4500 |
| 001 |
EB001075102 |
| 003 |
EBX01000000000000000837424 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
150804 ||| eng |
| 020 |
|
|
|a 9783319217505
|
| 100 |
1 |
|
|a Broniek, Przemysław
|
| 245 |
0 |
0 |
|a Computational Complexity of Solving Equation Systems
|h Elektronische Ressource
|c by Przemysław Broniek
|
| 250 |
|
|
|a 1st ed. 2015
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2015, 2015
|
| 300 |
|
|
|a IX, 64 p. 1 illus
|b online resource
|
| 505 |
0 |
|
|a Acknowledgments -- Chapter 1. Introduction -- Chapter 2. Unary algebras -- Chapter 3. Reducing CSP to SYSTERMSAT over unary algebras -- Chapter 4. Partial characterizations -- Chapter 5. Conclusions and Open Problems
|
| 653 |
|
|
|a Logic
|
| 653 |
|
|
|a Mathematical logic
|
| 653 |
|
|
|a Logic
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Mathematical Logic and Foundations
|
| 653 |
|
|
|a Algorithm Analysis and Problem Complexity
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a SpringerBriefs in Philosophy
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-21750-5?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.1
|
| 520 |
|
|
|a 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
|