**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

**The Art of Computer Programming, Volume 4**

by

**Donald E. Knuth**-

**Addison-Wesley Professional**

This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.

(

**21381**views)

**Algorithms and Data Structures**

by

**Niklaus Wirth**-

**Prentice Hall**

The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.

(

**13715**views)

**Computational Geometry: Methods and Applications**

by

**Jianer Chen**

The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.

(

**13007**views)

**Algorithms**

by

**Ian Craw, John Pulham**-

**University of Aberdeen**

This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.

(

**12103**views)