• Title: Algorithms and Complexity
• Author(s) Herbert S. Wilf
• Publisher: A K Peters/CRC Press; 2nd edition (December 1, 2002); eBook (Final Draft)
• Hardcover: 228 pages
• eBook: PDF
• Language: English
• ISBN-10: 1568811780
• ISBN-13: 978-1568811789
• Share This:  

Book Description

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.

• Herbert S. Wilf was a mathematician, specializing in combinatorics and graph theory. He was the Thomas A. Scott Professor of Mathematics at the University of Pennsylvania. In 1998 he received the Leroy P. Steele Prize for Seminal Contribution to Research, awarded by the American Mathematical Society, and in 1996 he was awarded the Deborah and Franklin Tepper Haimo Award for Distinguished College or University Teaching of mathematics.

• Amazon

• Algorithms and Data Structures
• Computational Complexity
• Computational and Algorithmic Mathematics
• Parallel Computing and Programming

• Algorithms and Complexity (Herbert S. Wilf)
• The Mirror Site (1) - PDF

• Mathematics and Computation (Avi Wigderson)

  This book provides a broad, conceptual overview of computational complexity theory - the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory, etc.

• Think Complexity: Science and Modeling, 2nd Ed. (Allen Downey)

  This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science. It presents features that make Python such a simple and powerful language. Code with a solution for each exercise.

• Complexity Theory: A Modern Approach (Sanjeev Arora, et al)

  This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation.

• Computability and Complexity: From a Programming Perspective

  This book is an introduction to the basic concepts of computability, complex, and the theory of programming languages. Its goal is to build a bridge between computability and complexity theory and other areas of computer science, especially programming.

• Quantum Computing Since Democritus (Scott Aaronson)

  This book takes readers on a tour through some of the deepest ideas of maths, computer science and physics. Full of insights, arguments and philosophical perspectives, the book covers an amazing array of topics.

• Traveling Salesman Problem, Theory and Applications

  This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem, including Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm.

• The Complexity of Boolean Functions (Ingo Wegener)

  Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. It presents a large number of recent research results f Boolean functions previously unavailable in book form.

• Computational Complexity (Wikibooks)

  This book contains material that should be core knowledge in the theory of computation for all graduates in computer science. It starts with classical computability theory which forms the basis for complexity theory.

• Computational Complexity: A Conceptual Perspective (Goldreich)

  This book offers a conceptual introduction to the study of the intrinsic complexity of computational tasks. It is intended to serve advanced undergraduate and graduate students, either as a textbook or for self-study.

• P, NP, and NP-Completeness: The Basics of Complexity

  The book starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P-versus-NP Question and the theory of NP-completeness.