Povej prijatelju o tem izdelku:
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
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 5. avgusta 2015 |
| ISBN13 | 9783319217499 |
| Založniki | Springer International Publishing AG |
| Strani | 64 |
| Dimenzije | 155 × 235 × 4 mm · 117 g |
| Jezik | Francoščina |
Božična darila lahko vrnete do 31. januarja