Algorithms and Complexity

Livro digital

Título:
Algorithms and Complexity

Autor:
Herbert S. Wilf

Categoria:
Tecnologia > Geral

Doador:
Raffaello D. N.

Sinopse:
A reader who wants to understand why some problems become fast, and others stay stubbornly hard, gets a guided path here. The book opens with Chapter 0’s “hard vs. easy problems,” then builds the tools in Chapter 1 through asymptotics, recurrences, counting, and graphs before turning to concrete methods. From there, it moves into recursive algorithms, Quicksort, recursive graph methods, fast matrix multiplication, the discrete Fourier transform, and FFT applications. Later chapters shift to network flow with Ford-Fulkerson and max-flow min-cut, then to number-theoretic algorithms such as gcd, primality testing, pseudoprimes, factoring, and cryptography. The final stretch reaches NP-completeness, Turing machines, Cook’s theorem, backtracking, and approximation. The result is a classic proof-oriented algorithms text that connects mathematical structure to real algorithmic technique. The table of contents shows a deliberate progression from foundations to advanced topics, and even includes unexpected breadth, especially the mix of FFT, cryptography, and complexity theory. It suits readers ready for rigorous analysis, not a beginner’s overview.