Lance Jeremy Fortnow was born on August 15,1963 and is a computer scientist known for major results in computational complexity and interactive proof systems.
11 Facts About Lance Fortnow
1.
2.
Lance Fortnow received a doctorate in applied mathematics from MIT in 1989, supervised by Michael Sipser.
3.
Lance Fortnow was the chair of ACM SIGACT and succeeded by Paul Beame.
4.
In September 2009, Lance Fortnow brought mainstream attention to complexity theory when he published an article surveying the progress made in the P versus NP problem in Communications of the Association for Computing Machinery.
5.
In November 1989, Lance Fortnow received an email from Noam Nisan showing that co-NP had multiple prover interactive proofs.
6.
Lance Fortnow has continued to publish on a variety of topics in the field of computational complexity including derandomization, sparse languages, and oracle machines.
7.
Lance Fortnow has published on quantum computing, game theory, genome sequencing and economics.
Related searches
Michael Sipser 8.
Lance Fortnow examined the logarithmic market scoring rule with market makers.
9.
Lance Fortnow has contributed to a study of the behavior of informed traders working with LMSR market makers.
10.
Lance Fortnow has written a science book, The Golden Ticket: P, NP and the Search for the Impossible, which was loosely based on an article he had written for CACM in 2009.
11.
Lance Fortnow further describes his book and illustrates why NP problems are so important on the Data Skeptic podcast.