Lance Fortnow

Selected Survey Talks

Beyond NP: The Work and Legacy of Larry Stockmeyer, Keynote address at the 37th ACM Symposium on Theory of Computing, Baltimore, May 22, 2005.
- Powerpoint
- PDF
- Companion Paper: PDF, Postscript.
My Favorite Ten Complexity Theorems of the Past Decade II, presented at Workshop on New Horizons in Computing, Kyoto, Japan, March 3, 2005.
- Powerpoint
- PDF
Church, Kolmogorov and von Neumann: Their Legacy Lives in Complexity, presented at NVTI Theoriedag, Utrecht, The Netherlands, March 7, 2003.
- Powerpoint
- PDF
History of Complexity, presented at the 17th Annual IEEE Conference on Computational Complexity, May 22, 2002.
- Powerpoint
Comparing Notions of Full Derandomization, presented at the Institute for Advanced Study Workshop on Complexity of Proofs and Computations, December 13, 2000.
- Powerpoint
Perspectives on Lower Bounds: Diagonalization , presented at the DIMACS Workshop on Computational Intractability, April 13, 2000.
- Powerpoint 2000
- Powerpoint 95-97
One complexity theorist's view of quantum computing, presented at the Second Workshop on Algorithms in Quantum Information Processing at DePaul University, Chicago, January 21, 1999.
- Powerpoint
Quantum Computation and Counting Complexity, presented at the Algorithms in Quantum Information Processing Workshop, Aarhus, Denmark, January 15, 1998.
- Index of slides.
- Powerpoint
25 Years of P versus NP, presented at the 25th Anniversary Celebration for Paul Vitanyi at the CWI, Amsterdam, November 15, 1996.
- Index of slides.
- Powerpoint
My Favorite Ten Complexity Theorems of the Past Decade, invited talk at the 14th FST&TCS Conference, Madras, India, December, 1994.

Free Viewers