Algorithm and Complexity

Methods for solving problems on computers and the costs (usually the running time) of using those methods.

**Tag(s):**
Theory of Computation

**Publication date**: 09 Dec 2002

**ISBN-10**:
1568811780

**ISBN-13**:
9781568811789

**Paperback**:
219 pages

**Views**: 36,536

Algorithm and Complexity

Methods for solving problems on computers and the costs (usually the running time) of using those methods.

Book excerpts:

This book is about algorithms and complexity, and so it is about methods for solving problems on computers and the costs (usually the running time) of using those methods.

Computing takes time. Some problems take a very long time, others can be done quickly. Some problems seem to take a long time, and then someone discovers a faster way to do them (a 'faster algorithm'). The study of the amount of computational effort that is needed in order to perform certain kinds of computations is the study of computational complexity.

Throughout the book there are opportunities to ask the readers to write programs and get them running. These are not mentioned explicitly, with a few exceptions, but will be obvious when encountered. The readers should all have the experience of writing, debugging, and using a program that is nontrivially recursive.

This book is about algorithms and complexity, and so it is about methods for solving problems on computers and the costs (usually the running time) of using those methods.

Computing takes time. Some problems take a very long time, others can be done quickly. Some problems seem to take a long time, and then someone discovers a faster way to do them (a 'faster algorithm'). The study of the amount of computational effort that is needed in order to perform certain kinds of computations is the study of computational complexity.

Throughout the book there are opportunities to ask the readers to write programs and get them running. These are not mentioned explicitly, with a few exceptions, but will be obvious when encountered. The readers should all have the experience of writing, debugging, and using a program that is nontrivially recursive.

Tweet

About The Author(s)

Herbert Wilf (1931-2012) was the University of Pennsylvania Thomas A. Scott Emeritus Professor of Mathematics. He was the author of six books and more than 160 research articles. From the 1950's, he was a pioneer in the mathematical programming of early computers, beginning with his work at Nuclear Development Associates, which led to his book Mathematical Methods for Digital Computers, written with A. Ralston. His early work focused on numerical analysis and complex analysis, and led to numerous research papers as well as a textbook, Mathematics for the Physical Sciences.

Book Categories

Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)

Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics

Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management

Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Microsoft .NET
Rexx
Perl
PHP
Python
R
Rebol
Ruby
Scheme
Tcl/Tk

Miscellaneous
Sponsors