06-13-2026, 10:20 AM
Algorithms and Complexity
H. Wilf
Summary Algorithms and Complexity by Herbert S. Wilf (originally published in 1994, with an Internet Edition in 1994 and a second edition in 2003) is an introductory textbook designed primarily for senior-level undergraduate and graduate students in computer science and mathematics.
The book focuses on how to design computer algorithms and analyze their "complexity"—the computational cost measured primarily in running time or storage space. It draws a critical distinction between tractable ("easy") problems, which can be solved using an algorithm with a polynomial-time guarantee, and intractable ("hard") problems, which lack such a guarantee.
BOOK PAGE
H. Wilf
Summary Algorithms and Complexity by Herbert S. Wilf (originally published in 1994, with an Internet Edition in 1994 and a second edition in 2003) is an introductory textbook designed primarily for senior-level undergraduate and graduate students in computer science and mathematics.
The book focuses on how to design computer algorithms and analyze their "complexity"—the computational cost measured primarily in running time or storage space. It draws a critical distinction between tractable ("easy") problems, which can be solved using an algorithm with a polynomial-time guarantee, and intractable ("hard") problems, which lack such a guarantee.
BOOK PAGE
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘