Lance Fortnow
Lance Fortnow | |
---|---|
Born | August 15, 1963 | (age 60)
Nationality | American |
Alma mater | |
Doctoral advisor | Michael Sipser |
Doctoral students | Carsten Lund |
Website | http://lance.fortnow.com/ http://blog.computationalcomplexity.org/ |
Lance Jeremy Fortnow (born August 15, 1963) is a
Biography
Lance Fortnow received a doctorate in applied mathematics from
Fortnow was the founding editor-in-chief of the journal ACM Transactions on Computation Theory in 2009.
Work
In his many publications, Fortnow has contributed important results to the field of
In November 1989, Fortnow received an email from
Fortnow has continued to publish on a variety of topics in the field of computational complexity including
Fortnow's work in economics includes work in game theory, optimal strategies and prediction. With Duke Whang, he has examined the classic game theory problem of the
Fortnow has also written a popular science book, The Golden Ticket: P, NP and the Search for the Impossible,[18] which was loosely based on an article he had written for CACM in 2009.[19] In his book, Fortnow provides a non-technical introduction to the P versus NP problem and its algorithmic limitations. He further describes his book and illustrates why NP problems are so important on the Data Skeptic podcast.[20]
Awards and honors
- 2007 ACM Fellow
- NSF Presidential Faculty Fellow from 1992 to 1998
- Fulbright Scholarto the Netherlands in 1996 and 1997
- 2014 Nerode Prize
References
- ^ Lance Fortnow at the Mathematics Genealogy Project
- Georgia Tech College of Computing. March 19, 2012. Retrieved October 4, 2012.
- ^ Northwestern University Electrical Engineering and Computer Science Department Faculty
- ^ ACM Transactions on Computation Theory
- ^ ACM SIGACT
- ^ IEEE Conference on Computational Complexity
- ^ Computational Complexity weblog
- ^ J. Markoff, "Prizes Aside, the P-NP Puzzler Has Consequences" The New York Times, October 7, 2009(subscription required)
- L. Fortnow, "The Status of the P Versus NP Problem", Communications of the ACM 9 (2009) - ^ L. Fortnow, "The complexity of perfect zero-knowledge" in S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 327-343. JAI Press, Greenwich, 1989
- ^ L. Fortnow and M. Sipser, "Are there interactive protocols for co-NP languages?", Information Processing Letters, 28:249-251, 1988
- ^ C. Lund, L. Fortnow, H. Karloff, and N. Nisan, "Algebraic methods for interactive proof systems", Journal of the ACM, 39(4):859-868, 1992
- ^ A. Shamir, "IP = PSPACE", Journal of the ACM 39(4):869-877, 1992
- ^ L. Babai, L. Fortnow, and C. Lund, "Nondeterministic exponential time has two-prover interactive protocols", Computational Complexity, 1(1):3-40, 1991
- Symposium on the Theory of Computing, pages 21-31. ACM, New York, 1991
- ^ L. Fortnow and D. Whang, "Optimality and domination in repeated games with bounded players", in Proceedings of the 26th ACM Symposium on the Theory of Computing, pages 741-749. ACM, New York, 1994
- ^ Y. Chen, L. Fortnow, N. Lambert, D. Pennock and J. Wortman, "Complexity of combinatorial market makers", in Proceedings of the 9th ACM Conference on Electronic Commerce, pages 190-199. ACM, New York, 2008
- ^ Y. Chen, S. Dimitrov, R. Sami, D. Reeves, D. Pennock, R. Hanson, L. Fortnow, and R. Gonen, "Gaming prediction markets: Equilibrium strategies with a market maker", Algorithmica, 2009
- ^ Fortnow, Lance The Golden Ticket: P, NP and the Search for the Impossible., Princeton University Press, 2013
- ^ Fortnow, Lance, "The Status of the P Versus NP Problem", review article in Communications of the ACM, 52(9): 78-86, September 2009
- ^ "P vs NP", Data Skeptic, 2017