Povej prijatelju o tem izdelku:
The Computational Complexity of Equivalence and Isomorphism Problems - Lecture Notes in Computer Science Thomas Thierauf 2000 edition
The Computational Complexity of Equivalence and Isomorphism Problems - Lecture Notes in Computer Science
Thomas Thierauf
A computational model is a framework for doing computations according to certain specified rules on some input data. This monograph analyzes the computational complexity of the satisfiability, equivalence, and almost equivalence problems with respect to various computational models.
135 pages, biography
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 4. avgusta 2000 |
| ISBN13 | 9783540410324 |
| Založniki | Springer-Verlag Berlin and Heidelberg Gm |
| Strani | 135 |
| Dimenzije | 155 × 233 × 8 mm · 217 g |
| Jezik | Angleščina |