國立虎尾科技大學 |

Computational Complexity of Solving Equation Systems

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computational Complexity of Solving Equation Systems/ by Przemysław Broniek.
作者:	Broniek, Przemysław.
面頁冊數:	IX, 64 p. 1 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-319-21750-5
ISBN:	9783319217505

Computational Complexity of Solving Equation Systems
Broniek, Przemysław.

Computational Complexity of Solving Equation Systems[electronic resource] /by Przemysław Broniek. - 1st ed. 2015. - IX, 64 p. 1 illus.online resource. - SpringerBriefs in Philosophy,2211-4548. - SpringerBriefs in Philosophy,.

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.

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.

ISBN: 9783319217505

Standard No.: 10.1007/978-3-319-21750-5doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Computational Complexity of Solving Equation Systems
LDR:02498nam a22003975i 4500 001 965802
003 DE-He213
005 20200704022805.0
007 cr nn 008mamaa
008 201211s2015 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
035 $a 978-3-319-21750-5
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 005.1 $2 23
100 1 $a Broniek, Przemysław. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1261440
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-4548
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. $3 527865
650 0 $a Logic. $3 558909
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Mathematical Logic and Foundations. $3 669393
710 2 $a SpringerLink (Online service) $3 593884
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-4548 $3 1254230
856 4 0 $u https://doi.org/10.1007/978-3-319-21750-5
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)