Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this

Table Of Contents

0.1 Books and algorithms
0.2 Enter Fibonacci
0.3 Big-O notation
Algorithms with numbers
1.1 Basic arithmetic
1.2 Modular arithmetic
Two’s complement
Is your social security number a prime?
1.3 Primality testing
Hey, that was group theory!
Carmichael numbers
Randomized algorithms: a virtual chapter
1.4 Cryptography
An application of number theory?
1.5 Universal hashing
Divide-and-conquer algorithms
2.1 Multiplication
2.2 Recurrence relations
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-first search in undirected graphs
3.3 Depth-first search in directed graphs
3.4 Strongly connected components
Crawling fast
Paths in graphs
4.1 Distances
4.2 Breadth-first search
4.3 Lengths on edges
4.4 Dijkstra’s algorithm
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
Common subproblems
Of mice and men
6.4 Knapsack
6.5 Chain matrix multiplication
6.6 Shortest paths
On time and memory
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
Visualizing duality
7.5 Zero-sum games
7.6 The simplex algorithm
Linear programming in polynomial time
7.7 Postscript: circuit evaluation
8.1 Search problems
8.2 NP-complete problems
The two ways to use reductions
8.3 The reductions
Unsolvable problems
9.1 Intelligent exhaustive search
9.2 Approximation algorithms
9.3 Local search heuristics
10.1 Qubits, superposition, and measurement
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
10.7 The quantum algorithm for factoring
Quantum physics meets computation
Historical notes and further reading
0 of .
Results for:
No results containing your search query
P. 1




|Views: 127 |Likes:
Published by anonymous_65536

More info:

Published by: anonymous_65536 on Feb 09, 2010
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 7 to 80 are not shown in this preview.
You're Reading a Free Preview
Pages 87 to 118 are not shown in this preview.
You're Reading a Free Preview
Pages 125 to 223 are not shown in this preview.
You're Reading a Free Preview
Pages 230 to 232 are not shown in this preview.
You're Reading a Free Preview
Pages 239 to 318 are not shown in this preview.

Activity (6)

You've already reviewed this. Edit your review.
1 hundred reads
vijaybpujari liked this
partho1432513 liked this
lekso liked this
ezragsit liked this
askician liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->