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 The New Eastern Mediterranean by Przemysław Broniek
Cover of the book New Directions in Teaching Theatre Arts by Przemysław Broniek
Cover of the book Deep-Sea Mining by Przemysław Broniek
Cover of the book Ecosystem Services of Headwater Catchments by Przemysław Broniek
Cover of the book Human-Centered Social Media Analytics by Przemysław Broniek
Cover of the book Practical Aspects of Declarative Languages by Przemysław Broniek
Cover of the book Applying Comparative Effectiveness Data to Medical Decision Making by Przemysław Broniek
Cover of the book Advancement of Optical Methods & Digital Image Correlation in Experimental Mechanics, Volume 3 by Przemysław Broniek
Cover of the book Software Engineering Research, Management and Applications by Przemysław Broniek
Cover of the book New Knowledge in Information Systems and Technologies by Przemysław Broniek
Cover of the book Advances in Nonlinear Geosciences by Przemysław Broniek
Cover of the book Guide to Unconventional Computing for Music by Przemysław Broniek
Cover of the book Seaports in International Law by Przemysław Broniek
Cover of the book Sex and Gender Differences in Infection and Treatments for Infectious Diseases by Przemysław Broniek
Cover of the book Nuclear Power Plant Emergencies in the USA 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