Fortæl dine venner om denne vare:
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
DKK 862
Bestilles fra fjernlager
Forventes klar til forsendelse 5. - 9. jan. 2026
Julegaver kan byttes frem til 31. januar
Tilføj til din iMusic ønskeseddel
eller
Findes også 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
| Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
| Udgivet | 9. december 2010 |
| ISBN13 | 9783642075810 |
| Forlag | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sider | 150 |
| Mål | 155 × 235 × 8 mm · 231 g |
| Sprog | Engelsk |
Mere med Lane A. Hemaspaandra
Vis alle![Cover for Lane A. Hemaspaandra · The Complexity Theory Companion - Texts in Theoretical Computer Science: an Eatcs Series (Paperback Bog) [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-paperback-bog&class=scaled&v=1408469230)
Se alt med Lane A. Hemaspaandra ( f.eks. Hardcover bog og Paperback Bog )