Custom cover image
Custom cover image

Computational Complexity of Solving Equation Systems / by Przemysław Broniek

By: Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerBriefs in Philosophy | SpringerLink Bücher | Springer eBook Collection Computer SciencePublisher: Cham : Springer, 2015Edition: 1st ed. 2015Description: Online-Ressource (IX, 64 p. 1 illus, online resource)ISBN:
  • 9783319217505
Subject(s): Additional physical formats: 9783319217499 | Druckausg.: 978-3-319-21749-9 MSC: MSC: *12-02 | 12Y05 | 68Q15LOC classification:
  • QA76.9.A43
DOI: DOI: 10.1007/978-3-319-21750-5Online resources: Summary: 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 openPPN: PPN: 1657510506Package identifier: Produktsigel: ZDB-2-SCS | ZDB-2-SHU | ZDB-2-SEB | ZDB-2-SXCS
No physical items for this record

Powered by Koha