Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series - Lane A. Hemaspaandra - Bøger - Springer-Verlag Berlin and Heidelberg Gm - 9783642075810 - 9. december 2010
Ved uoverensstemmelse mellem cover og titel gælder titel

Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series Softcover reprint of the original 1st ed. 2003 edition

Lane A. Hemaspaandra

Pris
Mex$ 2.467,50

Bestilles fra fjernlager

Forventes klar til forsendelse 11. - 17. nov.
Julegaver kan byttes frem til 31. januar

Vores kunder siger:

14 dages fuld returret
Topvurdering på Trustpilot
Tilføj til din iMusic ønskeseddel
eller

Findes også som:

Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series Softcover reprint of the original 1st ed. 2003 edition

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  
Vis alle

Mere med Lane A. Hemaspaandra

Se alt med Lane A. Hemaspaandra ( f.eks. Hardcover bog og Paperback Bog )