Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Texts in Theoretical Computer Science. An EATCS Series - Juraj Hromkovic - Bøker - Springer-Verlag Berlin and Heidelberg Gm - 9783540441342 - 9. oktober 2002
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Texts in Theoretical Computer Science. An EATCS Series 2nd ed. 2003. Corr. 2nd printing 2004 edition

Juraj Hromkovic

Pris
NOK 1.129

Bestillingsvarer

Forventes levert 25. jul - 5. aug
Legg til iMusic ønskeliste
Eller

Finnes også som:

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Texts in Theoretical Computer Science. An EATCS Series 2nd ed. 2003. Corr. 2nd printing 2004 edition

Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies.


538 pages, biography

Media Bøker     Innbunden bok   (Bok med hard rygg og stivt omslag)
Utgitt 9. oktober 2002
ISBN13 9783540441342
Utgivere Springer-Verlag Berlin and Heidelberg Gm
Antall sider 538
Mål 155 × 235 × 30 mm   ·   916 g
Språk Engelsk   Tysk  

Vis alle

Mer med Juraj Hromkovic