Introduction to Algorithms, fourth edition
Afbeeldingen
Sla de afbeeldingen overArtikel vergelijken
Auteur:
Thomas H. Cormen
Charles E. Leiserson
- Engels
- Hardcover
- 9780262046305
- 05 april 2022
- 1332 pagina's
Thomas H. Cormen
"Thomas H. Cormen is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. In 2013, he published a new book titled Algorithms Unlocked. He is a professor of computer science at Dartmouth College and former Chair of the Dartmouth College Department of Computer Science. Between 2004 and 2008 he directed the Dartmouth College Writing Program. His research interests are algorithm engineering, parallel computing, speeding up computations with high latency.
(Bron: Wikipedia. Beschikbaar onder de licentie Creative Commons Naamsvermelding/Gelijk delen.)"
(Bron: Wikipedia. Beschikbaar onder de licentie Creative Commons Naamsvermelding/Gelijk delen.)"
Samenvatting
A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout.
New for the fourth edition
Warning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout.
New for the fourth edition
- New chapters on matchings in bipartite graphs, online algorithms, and machine learning
- New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays
- 140 new exercises and 22 new problems
- Reader feedbackinformed improvements to old problems
- Clearer, more personal, and gender-neutral writing style
- Color added to improve visual presentation
- Notes, bibliography, and index updated to reflect developments in the field
- Website with new supplementary material
Warning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.
Productspecificaties
Wij vonden geen specificaties voor jouw zoekopdracht '{SEARCH}'.
Inhoud
- Taal
- en
- Bindwijze
- Hardcover
- Oorspronkelijke releasedatum
- 05 april 2022
- Aantal pagina's
- 1332
- Illustraties
- Met illustraties
Betrokkenen
- Hoofdauteur
- Thomas H. Cormen
- Tweede Auteur
- Charles E. Leiserson
- Hoofduitgeverij
- Mit Press Ltd
Overige kenmerken
- Editie
- 4
- Studieboek
- Nee
- Verpakking breedte
- 211 mm
- Verpakking hoogte
- 53 mm
- Verpakking lengte
- 235 mm
- Verpakkingsgewicht
- 2188 g
EAN
- EAN
- 9780262046305
Je vindt dit artikel in
- Categorieën
- Taal
- Engels
- Boek, ebook of luisterboek?
- Boek
- Beschikbaarheid
- Leverbaar
- Studieboek of algemeen
- Studieboeken
Kies gewenste uitvoering
Kies je bindwijze
(2)
Prijsinformatie en bestellen
De prijs van dit product is 107 euro en 99 cent.
Uiterlijk 28 mei in huis
Verkoop door bol
- Prijs inclusief verzendkosten, verstuurd door bol
- Ophalen bij een bol afhaalpunt mogelijk
- 30 dagen bedenktijd en gratis retourneren
- Dag en nacht klantenservice
Vaak samen gekocht
Rapporteer dit artikel
Je wilt melding doen van illegale inhoud over dit artikel:
- Ik wil melding doen als klant
- Ik wil melding doen als autoriteit of trusted flagger
- Ik wil melding doen als partner
- Ik wil melding doen als merkhouder
Geen klant, autoriteit, trusted flagger, merkhouder of partner? Gebruik dan onderstaande link om melding te doen.