The Computational Complexity of Equivalence and Isomorphism Problems - Lecture Notes in Computer Science - Thomas Thierauf - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540410324 - 2000. gada 4. augusts
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

The Computational Complexity of Equivalence and Isomorphism Problems - Lecture Notes in Computer Science 2000 edition

Cena
€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 17. - 27. jūl.
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2000. gada 4. augusts
ISBN13 9783540410324
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 135
Izmēri 155 × 233 × 8 mm   ·   217 g
Valoda Angļu  

Mere med samme udgiver