Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

Preface
Prologue
0.1 Books and algorithms
0.2 Enter Fibonacci
0.3 Big-O notation
Exercises
Algorithms with numbers
1.1 Basic arithmetic
1.2 Modular arithmetic
Is your social security number a prime?
1.3 Primality testing
1.4 Cryptography
1.5 Universal hashing
Divide-and-conquer algorithms
2.1 Multiplication
2.2 Recurrence relations
Binary search
2.3 Mergesort
2.4 Medians
The Unix sort command
2.5 Matrix multiplication
2.6 The fast Fourier transform
The slow spread of a fast algorithm
Decompositions of graphs
3.1 Why graphs?
How big is your graph?
3.2 Depth-ﬁrst search in undirected graphs
3.3 Depth-ﬁrst search in directed graphs
3.4 Strongly connected components
Crawling fast
Paths in graphs
4.1 Distances
4.3 Lengths on edges
4.4 Dijkstra’s algorithm
Which heap is best?
4.5 Priority queue implementations
4.6 Shortest paths in the presence of negative edges
4.7 Shortest paths in dags
Greedy algorithms
5.1 Minimum spanning trees
A randomized algorithm for minimum cut
5.2 Huffman encoding
5.3 Horn formulas
5.4 Set cover
Dynamic programming
6.1 Shortest paths in dags, revisited
6.2 Longest increasing subsequences
Recursion? No, thanks
6.3 Edit distance
6.4 Knapsack
Memoization
6.5 Chain matrix multiplication
6.6 Shortest paths
6.7 Independent sets in trees
Linear programming and reductions
7.1 An introduction to linear programming
A magic trick called duality
7.2 Flows in networks
7.3 Bipartite matching
7.4 Duality
7.5 Zero-sum games
7.6 The simplex algorithm
Linear programming in polynomial time
7.7 Postscript: circuit evaluation
NP-complete problems
8.1 Search problems
8.2 NP-complete problems
Why P and NP?
8.3 The reductions
9.1 Intelligent exhaustive search
9.2 Approximation algorithms
9.3 Local search heuristics
10.1 Qubits, superposition, and measurement
Entanglement
10.2 The plan
10.3 The quantum Fourier transform
10.4 Periodicity
The Fourier transform of a periodic vector
10.5 Quantum circuits
10.6 Factoring as periodicity
Setting up a periodic superposition
10.7 The quantum algorithm for factoring
Historical notes and further reading
Index
0 of .
Results for:
P. 1
All

# All

Ratings: (0)|Views: 1,647|Likes:

Published by: Mazniker Pavel on Nov 08, 2011

### Availability:

Read on Scribd mobile: iPhone, iPad and Android.
See more
See less

11/08/2011

pdf

text

original

You're Reading a Free Preview
Pages 7 to 34 are not shown in this preview.
You're Reading a Free Preview
Pages 41 to 74 are not shown in this preview.
You're Reading a Free Preview
Pages 81 to 207 are not shown in this preview.
You're Reading a Free Preview
Pages 214 to 262 are not shown in this preview.
You're Reading a Free Preview
Pages 269 to 336 are not shown in this preview.

## Activity (1)

You've already reviewed this. Edit your review.