Lance Fortnow
| Lance Fortnow | |
|---|---|
| Born | August 15, 1963 (age 53) |
| Nationality | American |
| Fields | Computer science |
| Institutions |
Georgia Tech Northwestern University University of Chicago |
| Alma mater |
Cornell University Massachusetts Institute of Technology |
| Doctoral advisor | Michael Sipser |
| Doctoral students |
Carsten Lund Dieter van Melkebeek |
| Known for | Interactive proofs |
| Notable awards | ACM Fellow, NSF Presidential Faculty Fellow, Fulbright Scholar, Nerode Prize |
|
Website http://lance.fortnow.com/ http://blog.computationalcomplexity.org/ |
|
Lance Jeremy Fortnow (born August 15, 1963) is a computer scientist known for major results in computational complexity and interactive proof systems. He currently chairs the School of Computer Science at Georgia Tech.
Lance Fortnow received a doctorate in Applied Mathematics from MIT in 1989, supervised by Michael Sipser. Since graduation, he's served on the faculty of the University of Chicago (1989-1999, 2003-2007), Northwestern University (2008-2012), and most recently the Georgia Institute of Technology (2012–present) as chair of the School of Computer Science.
Fortnow was the founding editor-in-chief of the journal ACM Transactions on Computation Theory. He was the chair of ACM SIGACT and succeeded by Paul Beame. He was the chair of the IEEE Conference on Computational Complexity from 2000 to 2006. In 2003, Fortnow began one of the first blogs devoted to theoretical computer science and has written for it since then; since 2007 he has had a co-blogger, William Gasarch. In September 2009, Fortnow brought mainstream attention to complexity theory when he published an article surveying the progress made in the P versus NP problem in the Communications of the Association of Computing Machinery.
In his many publications, Fortnow has contributed important results to the field of computational complexity. While still a graduate student at MIT, Fortnow showed that there are no perfect zero-knowledge for NP-complete languages unless the polynomial hierarchy collapses. With Michael Sipser, he also demonstrated that relative to a specific oracle there exists a language in co-NP that does not have an interactive protocol.
...
Wikipedia