Gå direkt till innehållet
Computational Complexity of Solving Equation Systems
Spara

Computational Complexity of Solving Equation Systems

Lägsta pris på PriceRunner
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.
Upplaga
1st ed. 2015
ISBN
9783319217499
Språk
Engelska
Vikt
310 gram
Utgivningsdatum
2015-08-05
Sidor
64