Free Shipping to all UK customers for orders over £25.00
Free Shipping to all UK customers for orders over £25.00
Free Shipping to all UK customers for orders over £25.00
Product Categories
My Shopping Cart
You shopping cart is empty
You may browse our offerings to locate what you're searching for, then put it in your shopping cart.
Computational Complexity of Solving Equation Systems
Usually dispatched within 3 - 5 business days.
In
Stock (549)
£ 53.99
Description
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.
Book Details
Classification:
EAN:
9783319217499
Binding:
Paperback / softback
Dimensions(mm):
235 x 155
Publication Date:
2015-08-05
Publisher:
Series:
Publication Country:
Switzerland