02663nam 2200613 a 450 991082575260332120200520144314.00-429-29492-11-56881-574-31-4398-6379-2(CKB)3400000000002148(OCoLC)560284432(CaPaEBR)ebrary10159701(SSID)ssj0000276775(PQKBManifestationID)11237832(PQKBTitleCode)TC0000276775(PQKBWorkID)10226736(PQKB)10548081(MiAaPQ)EBC3059497(Au-PeEL)EBL3059497(CaPaEBR)ebr10159701(OCoLC)922955591(FlBoTFG)9780429294921(EXLCZ)99340000000000214820020531d2002 uy 0engur||| |||||txtccrAlgorithms and complexity /Herbert S. Wilf2nd ed.Natick, Mass. A.K. Petersc20021 online resource (229 p.) Bibliographic Level Mode of Issuance: Monograph1-56881-178-0 Includes bibliographical references and index.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.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.Problem solvingData processingComputer algorithmsComputational complexityProblem solvingData processing.Computer algorithms.Computational complexity.511/.8Wilf Herbert S.1931-12671MiAaPQMiAaPQMiAaPQBOOK9910825752603321Algorithms and complexity975756UNINA