Computational complexity of solving equation systems
Auteur :
Broniek, Przemysław
Éditeur :
Springer International Publishing AG
ISBN :
9783319217499
Date de publication :
5 août 2015
Dimensions :
23,5 x 15,5 cm
Langue :
Anglais
Pays d'origine :
Suisse
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.