☰

Lance Fortnow

Affiliations: 
University of Chicago, Chicago, IL 
Area:
Computer Science
Google:
"Lance Fortnow"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor
Michael Sipser grad student MIT

Children

Sign in to add trainee
Rahul Santhanam grad student 2005 Chicago
Varsha Dani grad student 2008 Chicago

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Fortnow L, Santhanam R. (2016) New non-uniform lower bounds for uniform classes Leibniz International Proceedings in Informatics, Lipics. 50: 19:1-19:14
Fortnow L. (2012) The enduring legacy of the Turing machine Computer Journal. 55: 830-831
Fortnow L, Santhanam R. (2011) Infeasibility of instance compression and succinct PCPs for NP Journal of Computer and System Sciences. 77: 91-106
Fortnow L, Santhanam R. (2011) Robust simulations and significant separations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6755: 569-580
Fortnow L, Grochow JA. (2011) Complexity classes of equivalence problems revisited Information and Computation. 209: 748-763
Fortnow L, Hitchcock JM, Pavan A, et al. (2011) Extracting Kolmogorov complexity with applications to dimension zero-one laws Information and Computation. 209: 627-636
Fortnow L, Lutz JH, Mayordomo E. (2010) Inseparability and strong hypotheses for disjoint NP pairs Leibniz International Proceedings in Informatics, Lipics. 5: 395-404
Fortnow L. (2009) Theory of Computing. 5: 135-140
Fortnow L. (2009) The status of the P versus NP problem Communications of the Acm. 52: 78-86
Fortnow L, Santhanam R, Williams R. (2009) Fixed-Polynomial size circuit bounds Proceedings of the Annual Ieee Conference On Computational Complexity. 19-26
See more...