Fortell venner om denne varen:
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
S$ 139,50
Bestillingsvarer
Forventes levert 3. - 11. des
Julegaver kan byttes frem til 31. januar
Legg til iMusic ønskeliste
eller
Finnes 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
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 9. desember 2010 |
| ISBN13 | 9783642075810 |
| Utgivere | Springer-Verlag Berlin and Heidelberg Gm |
| Antall sider | 150 |
| Mål | 155 × 235 × 8 mm · 231 g |
| Språk | Engelsk |
Vis alle
Mer med Lane A. Hemaspaandra
![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 ( f.eks. Pocketbok og Innbunden bok )