Algorithms de Dasgupta, Sanjoy; Papadimitriou, Christos; Vazirani, Umesh: very_good (2006)

Descripci�n

Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you� re not satisfied with purchase please return item for full refund. Ships USPS Media Mail.

N� de ref. del art�culo OTV.0073523402.VG

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Algorithms
Editor: McGraw-Hill Education
Fecha de publicaci�n: 2006
Idioma: Ingl�s
ISBN 10: 0073523402
ISBN 13: 9780073523408
Encuadernaci�n: Encuadernaci�n de tapa blanda
Estado: very_good

Acerca de

Sinopsis

This text explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. "Algorithms" is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject.

Rese�a del editor

This text explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. "Algorithms" is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject.

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