Introduction to Algorithms, Third Edition, 3. udgave - Køb den hos Polyteknisk Boghandel

SØG - mellem flere end 8 millioner bøger:

Viser: Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest og Clifford Stein

(2009)

Sprog: Engelsk

MIT Press

1.025,00 kr.

10 stk på lager

Hvor kan jeg afhente varen?

Bestil nu og få den leveret inden for 2-3 hverdage.

Porto kan blive tilføjet, se takster her

Du kan vælge at få vare sendt eller afhente den i en af vores butikker. Vælger du at få den sendt koster det:

Levering på adressen
1 - 1 vare – kr.	59.5
2 - 5 varer – kr.	59.5
6 - 10 varer – kr.	59.5
11 - 20 varer – kr.	59.5
21 - 49 varer – kr.	79.5
50 - 9999 varer – kr.	119.5

Levering på firma adressen
1 - 1 vare – kr.	39.5
2 - 5 varer – kr.	39.5
6 - 10 varer – kr.	39.5
11 - 20 varer – kr.	39.5
21 - 49 varer – kr.	79.5
50 - 9999 varer – kr.	119.5

Afhent i postbutik eller pakkeboks
1 - 1 vare – kr.	39.5
2 - 5 varer – kr.	39.5
6 - 10 varer – kr.	39.5
11 - 20 varer – kr.	39.5
21 - 49 varer – kr.	59.5
50 - 9999 varer – kr.	99.5

Læs mere om forsendelse her

Detaljer om varen

3. Udgave
Hardback: 1312 sider
Udgiver: MIT Press (Juli 2009)
Forfattere: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest og Clifford Stein
ISBN: 9780262033848

Beskrivelse

The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

De oplyste priser er inkl. moms