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 Coastal Ocean Observing by Przemysław Broniek
Cover of the book Strategies Towards the New Sustainability Paradigm by Przemysław Broniek
Cover of the book Researching the Global Education Industry by Przemysław Broniek
Cover of the book Infectious Disease Modeling by Przemysław Broniek
Cover of the book Security and Trust Management by Przemysław Broniek
Cover of the book Green, Pervasive, and Cloud Computing by Przemysław Broniek
Cover of the book The Two-Photon Decay of the 11-/2 Isomer of 137Ba and Mixed-Symmetry States of 92,94Zr and 94Mo by Przemysław Broniek
Cover of the book Understanding Gaia by Przemysław Broniek
Cover of the book Landscapes and Landforms of Egypt by Przemysław Broniek
Cover of the book Autocratization in post-Cold War Political Regimes by Przemysław Broniek
Cover of the book Research Challenges in Modeling and Simulation for Engineering Complex Systems by Przemysław Broniek
Cover of the book Bridging the Skills Gap by Przemysław Broniek
Cover of the book Augmented Reality, Virtual Reality, and Computer Graphics by Przemysław Broniek
Cover of the book Mind, Values, and Metaphysics by Przemysław Broniek
Cover of the book Properly Colored Connectivity of Graphs 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