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 Genetic Programming by Przemysław Broniek
Cover of the book White Space Communication by Przemysław Broniek
Cover of the book Local Ownership in Asian Peacebuilding by Przemysław Broniek
Cover of the book Finding the Personal Voice in Filmmaking by Przemysław Broniek
Cover of the book Experimental Algorithms by Przemysław Broniek
Cover of the book Theoretical and Empirical Studies on Cooperatives by Przemysław Broniek
Cover of the book Transforming Heritage Practice in the 21st Century by Przemysław Broniek
Cover of the book Architecture and Mathematics from Antiquity to the Future by Przemysław Broniek
Cover of the book The Horizontal Metropolis Between Urbanism and Urbanization by Przemysław Broniek
Cover of the book Advances in Geriatric Dermatology by Przemysław Broniek
Cover of the book Operational Research by Przemysław Broniek
Cover of the book Novel Measurement and Assessment Tools for Monitoring and Management of Land and Water Resources in Agricultural Landscapes of Central Asia by Przemysław Broniek
Cover of the book The Caribbean Oral Tradition by Przemysław Broniek
Cover of the book Information and Communications Security by Przemysław Broniek
Cover of the book State-Trace Analysis 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