Computational Complexity of Solving Equation Systems (1st ed. 2016) (SpringerBriefs in Philosophy)

By:

Sign Up Now! Already a Member? Log In
You must be logged into UK education collection to access this title. Learn about membership options, or view our freely available titles.

Synopsis
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.
Copyright:
2015

Book Details

Book Quality:
Publisher Quality
ISBN-13:
9783319217505
Related ISBNs:
9783319217499
Publisher:
Springer International Publishing
Date of Addition:
Copyrighted By:
N/A
Adult content:
No
Language:
English
Has Image Descriptions:
No
Categories:
Nonfiction, Computers and Internet, Mathematics and Statistics, Philosophy
Submitted By:
Bookshare Staff
Usage Restrictions:
This is a copyrighted book.

Reviews

No Rating Yet