Lance Fortnow

E199753

American academic computer scientist person theoretical computer scientist

Lance Fortnow is an American theoretical computer scientist known for his contributions to computational complexity theory and for his expository work on the P vs NP problem.

Try in SPARQL Jump to: Surface forms Statements Referenced by

All labels observed (1)

Label	Occurrences
Lance Fortnow canonical	4

Statements (47)

Predicate	Object
instanceOf	American academic ⓘ computer scientist ⓘ person ⓘ theoretical computer scientist ⓘ
almaMater	Cornell University ⓘ Massachusetts Institute of Technology ⓘ
award	Fellow of the American Association for the Advancement of Science ⓘ surface form: AAAS Fellow Fellow of the Association for Computing Machinery ⓘ surface form: ACM Fellow
blogTopic	computational complexity theory ⓘ theoretical computer science ⓘ
citizenship	United States of America ⓘ surface form: United States
coauthor	Bill Gasarch ⓘ
degree	Bachelor's degree from Cornell University ⓘ PhD in computer science from Massachusetts Institute of Technology ⓘ
doctoralAdvisor	Michael Sipser ⓘ
editorialRole	editor-in-chief of the ACM Transactions on Computation Theory ⓘ former editor of the Complexity Theory Column of SIGACT News ⓘ
employer	Georgia Institute of Technology ⓘ Illinois Institute of Technology ⓘ
field	computational complexity theory ⓘ theoretical computer science ⓘ
genre	popular science writing ⓘ
hasBlog	Computational Complexity blog ⓘ
knownFor	computational complexity theory ⓘ expository work on the P versus NP problem ⓘ popularizing the P versus NP problem ⓘ research on interactive proof systems ⓘ research on relativization in complexity theory ⓘ
language	English ⓘ
nationality	United States of America ⓘ surface form: United States
notableConcept	relativization barriers in complexity theory ⓘ
notableWork	The Golden Ticket: P, NP, and the Search for the Impossible ⓘ
occupation	author ⓘ department chair ⓘ professor ⓘ
position	Dean of the College of Computing at Illinois Institute of Technology ⓘ Professor at Georgia Institute of Technology ⓘ
professionalMembership	Association for Computing Machinery ⓘ IEEE Computer Society ⓘ
researchArea	P versus NP problem ⓘ complexity theory and randomness ⓘ interactive proofs ⓘ relativization ⓘ
teachingArea	computational complexity ⓘ theory of computation ⓘ
writesAbout	implications of P versus NP for society ⓘ limits of efficient computation ⓘ

Referenced by (4)

Full triples — surface form annotated when it differs from this entity's canonical label.

Leonard Adleman → notableStudent → Lance Fortnow ⓘ

Richard Lipton → coAuthor → Lance Fortnow ⓘ

Richard Lipton → notableStudent → Lance Fortnow ⓘ

MIP equals NEXP → hasAuthor → Lance Fortnow ⓘ

subject surface form: MIP = NEXP