Tipsa dina vänner om produkten:
The Computational Complexity of Equivalence and Isomorphism Problems - Lecture Notes in Computer Science Thomas Thierauf 2000 edition
Pris
SEK 569
Beställningsvara
Förväntad leverans 23 okt - 2 nov
Få avisering om nya utgåvor med Thomas Thierauf
Lägg till din iMusic-önskelista
eller
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
| Media | Böcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 4 augusti 2000 |
| ISBN13 | 9783540410324 |
| Utgivare | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sidor | 135 |
| Mått | 155 × 233 × 8 mm · 217 g |
| Språk | Engelska |