Gå direkte til innholdet
Computational Complexity of Solving Equation Systems
Spar

Computational Complexity of Solving Equation Systems

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.
Opplag
1st ed. 2015
ISBN
9783319217499
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
5.8.2015
Antall sider
64