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

Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series 2003 edition

Lane A. Hemaspaandra

Pris
DKK 861

Bestilles fra fjernlager

Forventes klar til forsendelse 8. - 12. sep.

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 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.

159 pages, 1 black & white illustrations, biography

Medie Bøger     Hardcover bog   (Bog med hård ryg og stift omslag)
Udgivet 28. oktober 2002
ISBN13 9783540422006
Forlag Springer-Verlag Berlin and Heidelberg Gm
Antal sider 150
Mål 166 × 241 × 16 mm   ·   358 g
Sprog Tysk  
Vis alle

Mere med Lane A. Hemaspaandra

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