TY - BOOK UR - http://lib.ugent.be/catalog/ebk01:3710000000452174 ID - ebk01:3710000000452174 ET - 1st ed. 2015. LA - eng TI - Computational Complexity of Solving Equation Systems PY - 2015 SN - 9783319217505 AU - Broniek, Przemysław. author. AB - 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. AB - 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. ER -Download RIS file
02760nam a22004815i 4500 | |||
001 | 978-3-319-21750-5 | ||
003 | DE-He213 | ||
005 | 20160406021831.0 | ||
007 | cr nn 008mamaa | ||
008 | 150724s2015 gw | 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 | |
082 | 4 | a 005.1 2 23 | |
100 | 1 | a Broniek, Przemysław. e author. | |
245 | 1 | 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-4548 | |
505 | 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 | a Computer science. | ||
650 | a Logic. | ||
650 | a Algorithms. | ||
650 | a Mathematical logic. | ||
650 | 1 | 4 | a Computer Science. |
650 | 2 | 4 | a Algorithm Analysis and Problem Complexity. |
650 | 2 | 4 | a Logic. |
650 | 2 | 4 | a Mathematical Logic and Foundations. |
710 | 2 | a SpringerLink (Online service) | |
773 | t Springer eBooks | ||
776 | 8 | i Printed edition: z 9783319217499 | |
830 | a SpringerBriefs in Philosophy, x 2211-4548 | ||
856 | 4 | u http://dx.doi.org/10.1007/978-3-319-21750-5 | |
912 | a ZDB-2-SCS | ||
950 | a Computer Science (Springer-11645) |
All data below are available with an Open Data Commons Open Database License. You are free to copy, distribute and use the database; to produce works from the database; to modify, transform and build upon the database. As long as you attribute the data sets to the source, publish your adapted database with ODbL license, and keep the dataset open (don't use technical measures such as DRM to restrict access to the database).
The datasets are also available as weekly exports.