Computational Complexity of Solving Equation Systems (Record no. 56741)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02809nam a22005055i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-21750-5 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421112043.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 150724s2015 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319217505 |
| -- | 978-3-319-21750-5 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 005.1 |
| 100 1# - AUTHOR NAME | |
| Author | Broniek, Przemys�aw. |
| 245 10 - TITLE STATEMENT | |
| Title | Computational Complexity of Solving Equation Systems |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2015. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | IX, 64 p. 1 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | SpringerBriefs in Philosophy, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | 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 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-21750-5 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2015. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Logic. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical logic. |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Logic. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical Logic and Foundations. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 2211-4548 |
| 912 ## - | |
| -- | ZDB-2-SCS |
No items available.