Scholar
Lance Fortnow
Google Scholar ID: Yf5wVssAAAAJ
Illinois Institute of Technology
Computational Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
12,360
H-index
50
i10-index
112
Publications
20
Co-authors
71
list available
Publications
3 items
$\mathrm{Almost}\text{-}\oplus\mathrm{P} = \mathrm{BP}\cdot\oplus\mathrm{P}$ and a Random-Oracle Proof of Toda's Theorem
2026
Cited
0
How Does Machine Learning Manage Complexity?
2026
Cited
0
Search versus Decision for $mathsf{S}_2^mathsf{P}$
2025
Cited
0
Co-authors
13 total
Harry Buhrman
Chief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoft
Rahul Santhanam
University of Oxford
Stephen Fenner
Professor of Computer Science and Engineering, University of South Carolina
Ronitt Rubinfeld
Professor of Computer Science, MIT and Tel Aviv University
Noam Nisan
Professor of Computer Science, Hebrew University of Jerusalem
David M Pennock
Professor, Rutgers University
Joan Feigenbaum
Grace Murray Hopper Professor of Computer Science, Yale University
Luís Antunes
Porto University