Tipsa dina vänner om produkten:
Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series Lane A. Hemaspaandra Softcover reprint of the original 1st ed. 2003 edition
Pris
SEK 1.069
Beställningsvara
Förväntad leverans 5 - 9 jan 2026
Julklappar kan bytas fram till 31:e januari
Lägg till din iMusic-önskelista
eller
Finns även som:
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.
160 pages, biography
| Media | Böcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 9 december 2010 |
| ISBN13 | 9783642075810 |
| Utgivare | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sidor | 150 |
| Mått | 155 × 235 × 8 mm · 231 g |
| Språk | Engelska |
Fler produkter med Lane A. Hemaspaandra
Visa alla![Cover for Lane A. Hemaspaandra · The Complexity Theory Companion - Texts in Theoretical Computer Science: an Eatcs Series (Pocketbok) [Softcover Reprint of Hardcover 1st Ed. 2002 edition] (2010)](https://imusic.b-cdn.net/images/item/original/847/9783642086847.jpg?lane-a-hemaspaandra-2010-the-complexity-theory-companion-texts-in-theoretical-computer-science-an-eatcs-series-pocketbok&class=scaled&v=1408469230)
Se alt med Lane A. Hemaspaandra ( t.ex. Inbunden Bok och Pocketbok )