Pastāsti draugiem par šo preci:
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2015. gada 5. augusts |
| ISBN13 | 9783319217499 |
| Izdevēji | Springer International Publishing AG |
| Lapas | 64 |
| Izmēri | 155 × 235 × 4 mm · 117 g |
| Valoda | Franču |