Algorithms and complexity /

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 w...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Wilf, Herbert S., 1931-2012
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Natick, Mass. : A.K. Peters, ©2002.
Edición:2nd ed.
Temas:
Problem solving > Data processing.
Computer algorithms.
Computational complexity.
Algorithms
Algorithmes.
Complexité de calcul (Informatique)
algorithms.
circuit.
COMPUTERS > Programming > Algorithms.
euler.
hamilton.
independent.
integer.
path.
polynomial.
positive.
set.
time.
Computational complexity
Computer algorithms
Problem solving > Data processing
Acceso en línea:Texto completo
Descripción
Sumario: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.
Descripción Física:1 online resource (ix, 219 pages) : illustrations
Bibliografía:Includes bibliographical references and index.
ISBN:9781439863794
1439863792

Ejemplares similares