Tipsa dina vänner om produkten:
Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series Lane A. Hemaspaandra 2003 edition
Pris
SEK 1.059
Beställningsvara
Förväntad leverans 31 dec - 8 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.
159 pages, 1 black & white illustrations, biography
| Media | Böcker Inbunden Bok (Inbunden bok med hårda pärmar och skyddsomslag) |
| Releasedatum | 28 oktober 2002 |
| ISBN13 | 9783540422006 |
| Utgivare | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sidor | 150 |
| Mått | 166 × 241 × 16 mm · 358 g |
| Språk | Tyska |
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 )