Tell your friends about this item:
Computational Complexity of Solving Equation Systems - SpringerBriefs in Philosophy Przemyslaw Broniek 1st ed. 2015 edition
Computational Complexity of Solving Equation Systems - SpringerBriefs in Philosophy
Przemyslaw Broniek
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.
64 pages, 1 black & white illustrations, biography
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | August 5, 2015 |
| ISBN13 | 9783319217499 |
| Publishers | Springer International Publishing AG |
| Pages | 64 |
| Dimensions | 155 × 235 × 4 mm · 117 g |
| Language | French |