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

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
R 2.473,75

Bestilles fra fjernlager

Forventes klar til forsendelse 24. - 31. jul.
Tilføj til din iMusic ønskeseddel
Eller

Findes 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

Medie Bøger     Hardcover bog   (Bog med hård ryg og stift omslag)
Udgivet 9. oktober 2002
ISBN13 9783540441342
Forlag Springer-Verlag Berlin and Heidelberg Gm
Antal sider 538
Mål 155 × 235 × 30 mm   ·   916 g
Sprog Engelsk   Tysk  

Vis alle

Mere med Juraj Hromkovic