Computational Complexity of Solving Equation Systems

Nonfiction, Religion & Spirituality, Philosophy, Logic, Computers, General Computing, Programming
Cover of the book Computational Complexity of Solving Equation Systems by Przemysław Broniek, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Przemysław Broniek ISBN: 9783319217505
Publisher: Springer International Publishing Publication: July 24, 2015
Imprint: Springer Language: English
Author: Przemysław Broniek
ISBN: 9783319217505
Publisher: Springer International Publishing
Publication: July 24, 2015
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer International Publishing

Cover of the book Nanoscience with Liquid Crystals by Przemysław Broniek
Cover of the book New Luxury Management by Przemysław Broniek
Cover of the book Stochastic Modeling by Przemysław Broniek
Cover of the book Correlations in Condensed Matter under Extreme Conditions by Przemysław Broniek
Cover of the book Data Analytics by Przemysław Broniek
Cover of the book Advances in Gender and Cultural Research in Business and Economics by Przemysław Broniek
Cover of the book Machine Learning and Knowledge Extraction by Przemysław Broniek
Cover of the book Couple Relationships in the 21st Century by Przemysław Broniek
Cover of the book The Ecosystems Revolution by Przemysław Broniek
Cover of the book Queerness in Play by Przemysław Broniek
Cover of the book Equations of Motion in Relativistic Gravity by Przemysław Broniek
Cover of the book Advances in Visual Informatics by Przemysław Broniek
Cover of the book Lourdes Arizpe by Przemysław Broniek
Cover of the book Surgical Emergencies in the Cancer Patient by Przemysław Broniek
Cover of the book Eurocode-Compliant Seismic Analysis and Design of R/C Buildings by Przemysław Broniek
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy