Cargando…
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 boo...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
| Edición: | 1st ed. 2015. |
| Colección: | SpringerBriefs in Philosophy,
|
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-21750-5 | ||
| 003 | DE-He213 | ||
| 005 | 20220118111309.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 150724s2015 sz | s |||| 0|eng d | ||
| 020 | |a 9783319217505 |9 978-3-319-21750-5 | ||
| 024 | 7 | |a 10.1007/978-3-319-21750-5 |2 doi | |
| 050 | 4 | |a QA76.9.A43 | |
| 072 | 7 | |a UMB |2 bicssc | |
| 072 | 7 | |a COM051300 |2 bisacsh | |
| 072 | 7 | |a UMB |2 thema | |
| 082 | 0 | 4 | |a 518.1 |2 23 |
| 100 | 1 | |a Broniek, Przemysław. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Computational Complexity of Solving Equation Systems |h [electronic resource] / |c by Przemysław Broniek. |
| 250 | |a 1st ed. 2015. | ||
| 264 | 1 | |a Cham : |b Springer International Publishing : |b Imprint: Springer, |c 2015. | |
| 300 | |a IX, 64 p. 1 illus. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a SpringerBriefs in Philosophy, |x 2211-4556 | |
| 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. | |
| 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. | ||
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Logic. | |
| 650 | 0 | |a Mathematical logic. | |
| 650 | 1 | 4 | |a Algorithms. |
| 650 | 2 | 4 | |a Logic. |
| 650 | 2 | 4 | |a Mathematical Logic and Foundations. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783319217499 |
| 776 | 0 | 8 | |i Printed edition: |z 9783319217512 |
| 830 | 0 | |a SpringerBriefs in Philosophy, |x 2211-4556 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-319-21750-5 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||