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
646
H-index
14
i10-index
21
Publications
20
Co-authors
9
list available
Publications
3 items
Quantified propositional calculi and narrow implicit proofs
2026
Cited
0
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
Co-authors
6 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
Bjørn Kjos-Hanssen
Professor of Mathematics, University of Hawaii at Manoa
