USED BOOKS! Fast Delivery USA Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-14 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.

N� de ref. del art�culo ASF 9780262046305

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Introduction to Algorithms, fourth edition 4th Edition
Editor: The MIT Press
Fecha de publicaci�n: 2022
Idioma: Ingl�s
ISBN 10: 026204630X
ISBN 13: 9780262046305
Encuadernaci�n: Hardcover
Edici�n: 4� Edici�n
Estado: USED BOOKS

Acerca de

Sinopsis

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

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 feedback–informed 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.

Acerca del autor

Thomas H. Cormen is Emeritus Professor of Computer Science at Dartmouth College. Charles E. Leiserson is Edwin Sibley Webster Professor in Electrical Engineering and Computer Science at MIT. Ronald L. Rivest is Institute Professor at MIT. Clifford Stein is Wai T. Chang Professor of Industrial Engineering and Operations Research, and of Computer Science at Columbia University.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.