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 Nonlinear Dynamics, Volume 2 by Przemysław Broniek
Cover of the book Network and System Security by Przemysław Broniek
Cover of the book Semiconductor Lasers by Przemysław Broniek
Cover of the book Fuzzy Logic in Intelligent System Design by Przemysław Broniek
Cover of the book 10th International Symposium on High-Temperature Metallurgical Processing by Przemysław Broniek
Cover of the book Mass-Market Fiction and the Crisis of American Liberalism, 1972–2017 by Przemysław Broniek
Cover of the book Emergency Department Management of Obstetric Complications by Przemysław Broniek
Cover of the book Elective Language Study and Policy in Israel by Przemysław Broniek
Cover of the book The Poetics of Migration in Contemporary Irish Poetry by Przemysław Broniek
Cover of the book Sex Workers and Criminalization in North America and China by Przemysław Broniek
Cover of the book NF-κB-Related Genetic Diseases by Przemysław Broniek
Cover of the book Fractional Dynamic Calculus and Fractional Dynamic Equations on Time Scales by Przemysław Broniek
Cover of the book Incognito Social Investigation in British Literature by Przemysław Broniek
Cover of the book Towards a Sustainable Bioeconomy: Principles, Challenges and Perspectives by Przemysław Broniek
Cover of the book Python For ArcGIS 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