Algorithms and complexity / / Herbert S. Wilf

• Autore: Wilf Herbert S. <1931->
• Pubblicazione: Natick, Mass., : A.K. Peters, c2002
• Edizione: 2nd ed.
• Descrizione fisica: 1 online resource (229 p.)
• Disciplina: 511/.8
• Soggetto topico: Problem solving - Data processing; Computer algorithms; Computational complexity
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Intro -- Contents -- Preface -- Preface to the Second Edition -- 0 What this Book Is About -- 1 Mathematical Preliminaries -- 2 Recursive Algorithms -- 3 The Network Flow Problem -- 4 Algorithms in the Theory of Numbers -- 5 NP-Completeness -- Hints and Solutions for Selected Problems -- Index.
• Sommario/riassunto: 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.
• Titolo autorizzato: Algorithms and complexity
• ISBN: 0-429-29492-1; 1-56881-574-3; 1-4398-6379-2
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910825752603321
• Lo trovi qui: Univ. Federico II