Algorithms complexity von wilf herbert (14 Ergebnisse)

Hardcover. Zustand: Good. No Jacket. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Zustand: Like New. First Edition. First Edition, First Printing. Published by Prentice Hall, 1986. Octavo. Hardcover. Book is like new. Dust jacket is like new. Signed and inscribed by author on flyleaf. Previous owner name on flyleaf.

Zustand: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: New. pp. 219.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New. In English.

Zustand: Gut. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Sprache: Englisch Gewicht in Gramm: 990.

Paperback. Zustand: Brand New. 2nd edition. 219 pages. 9.00x5.50x0.25 inches. In Stock.

Zustand: New. Herbert S. WilfThis book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fa.

Taschenbuch. Zustand: Neu. Neuware - This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.…

Zustand: New. In English.

Hardcover. Zustand: Brand New. 2nd edition. 219 pages. 9.25x6.25x0.75 inches. In Stock.