**Algorithms and Complexity**

by Herbert S. Wilf

**Publisher**: AK Peters, Ltd. 1994**ISBN/ASIN**: 1568811780**ISBN-13**: 9781568811789**Number of pages**: 139

**Description**:

This is an introductory textbook, suitable for classroom use, on the design and analysis of algorithms, complexity, methods for solving problems on computers and the costs (usually in running time) of using those methods.

Download or read it online for free here:

**Download link**

(0.8MB, PDF)

## Similar books

**Design and Analysis of Algorithms**

by

**Herbert Edelsbrunner**-

**Duke University**

The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.

(

**12655**views)

**Modern Computer Arithmetic**

by

**Richard P. Brent, Paul Zimmermann**-

**LORIA**

This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.

(

**9364**views)

**Problem Solving with Algorithms and Data Structures Using Python**

by

**Brad Miller, David Ranum**-

**Franklin, Beedle & Associates**

This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.

(

**6557**views)

**Algorithms for Clustering Data**

by

**Anil K. Jain, Richard C. Dubes**-

**Prentice Hall**

The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.

(

**13391**views)