ISBN: 9789814271400 - an introduction to the analysis of algorithms (17 resultados)

paperback. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Condición: New.

Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: Used. pp. xiii + 135.

Condición: As New. Unread book in perfect condition.

Condición: Used. pp. xiii + 135 Illus.

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: Used. pp. xiii + 135.

Condición: New.

Condición: New. In English.

Hardcover. Condición: Brand New. illustrated edition. 150 pages. 9.00x6.00x0.50 inches. In Stock.

Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants. The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions. This self-contained book is intended for undergraduate students in computer science and mathematics. …

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Covers the mathematical foundations of the analysis of algorithms. This book considers the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide and Conquer. It is suitable for undergraduate students in computer science an.…

Buch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants.The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions.This self-contained book is intended for undergraduate students in computer science and mathematics.…

Buch. Condición: Neu. INTRO TO THE ANALYSIS OF ALGORITHMS,AN | Soltys Michael | Buch | Gebunden | Englisch | 2009 | World Scientific | EAN 9789814271400 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.