Computational Complexity of Solving Equation Systems (Paperback, 1st ed. 2015)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	SpringerBriefs in Philosophy
Release date:	July 2015
First published:	2015
Authors:	Przemyslaw Broniek
Dimensions:	235 x 155 x 4mm (L x W x T)
Format:	Paperback
Pages:	64
Edition:	1st ed. 2015
ISBN-13:	978-3-319-21749-9
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Mathematical foundations > General Promotions
LSN:	3-319-21749-6
Barcode:	9783319217499

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!