Pastāsti draugiem par šo preci:
Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series Lane A. Hemaspaandra 2003 edition
Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series
Lane A. Hemaspaandra
The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness.
159 pages, 1 black & white illustrations, biography
| Mediji | Grāmatas Hardcover Book (Grāmata ar cieto muguriņu un vāku) |
| Izlaists | 2002. gada 28. oktobris |
| ISBN13 | 9783540422006 |
| Izdevēji | Springer-Verlag Berlin and Heidelberg Gm |
| Lapas | 150 |
| Izmēri | 166 × 241 × 16 mm · 358 g |
| Valoda | Vācu |
Vairāk no Lane A. Hemaspaandra
Rādīt visuVairāk no tā paša izdevēja
Skatīt visus Lane A. Hemaspaandra