 Combinatorics, Complexity, and Randomness
started 11/15/2002; 5:41:37 AM - last post 11/15/2002; 5:41:37 AM
|
|
Luke Gorrie - Combinatorics, Complexity, and Randomness 
11/15/2002; 5:41:37 AM (reads: 761, responses: 0)
|
|
| Combinatorics, Complexity, and Randomness |
|
Richard M. Karp's 1985 Turing Award lecture. He talks about some of the early days of applying computers to hard problems (like the Travelling Salesman), how the study of algorithmic complexity came about (and what P and NP are), and about why heuristic solutions to Hard problems can work very well.
Very enjoyable!
Posted to general by Luke Gorrie on 11/15/02; 5:43:22 AM
|
|
|
|
|
|