Scholar
Neil Thapen
Google Scholar ID: bOt3uDMAAAAJ
Researcher, Institute of Mathematics, Czech Academy of Sciences
mathematical logic
computational complexity
proof complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
268
H-index
9
i10-index
8
Publications
20
Co-authors
9
list available
Contact
No contact links provided.
Publications
2 items
On the consistency of stronger lower bounds for NEXP
2025
Cited
0
How to fit large complexity classes into TFNP
arXiv.org · 2024
Cited
0
Resume (English only)
Co-authors
9 total
Sam Buss
Professor of Mathematics and Computer Science
Massimo Lauria
Sapienza - Università di Roma
Nicola Galesi
Sapienza University Rome
Jakob Nordström
University of Copenhagen and Lund University
Yuval Filmus
Associate Professor, Technion
Co-author 6
Co-author 7
Co-author 8
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up