Detail produktu

Produkt mají v nabídce:

Bookshop
1 322 Kč
Do eshopu

Computational Complexity of Solving Equation Systems - Broniek, Przemyslaw

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.

Podobné produkty