Recomienda este artículo a tus amigos:
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
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 4 de agosto de 2000 |
| ISBN13 | 9783540410324 |
| Editores | Springer-Verlag Berlin and Heidelberg Gm |
| Páginas | 135 |
| Dimensiones | 155 × 233 × 8 mm · 217 g |
| Lengua | Inglés |