Algorithms and Complexity

Wilf, Herbert S.

ISBN 10: 0130219738 / ISBN 13: 9780130219732

Edité par Prentice Hall, Englewood Cliffs, NJ, 1986

A propos de cet article

Complete number line from 1 to 10; minor wear; publisher's stamp on top edge; previous owner's name on front end paper; otherwise a solid, clean copy with no marking or underlining; collectible condition.

N° de réf. du vendeur 015855

Détails bibliographiques

• Titre: Algorithms and Complexity
• Éditeur: Prentice Hall, Englewood Cliffs, NJ
• Date de parution: 1986
• Langue: anglais
• ISBN à 10 chiffres: 0130219738
• ISBN à 13 chiffres: 9780130219732
• Reliure: Hardcover
• Édition: American First.
• État de l'article: Very Good+
• État de la jaquette: No Jacket as Issued
• Type de livre: Book

A propos de ce titre

Synopsis

Book by Wilf Herbert S

Présentation de l'éditeur

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.