Neil Thapen
Neil Thapen
Researcher, Institute of Mathematics, Czech Academy of Sciences
Verified email at math.cas.cz - Homepage
Title
Cited by
Cited by
Year
Space complexity in polynomial calculus
Y Filmus, M Lauria, J Nordstrom, N Ron-Zewi, N Thapen
SIAM Journal on Computing 44 (4), 1119-1153, 2015
552015
The strength of replacement in weak arithmetic
S Cook, N Thapen
ACM Transactions on Computational Logic (TOCL) 7 (4), 749-764, 2006
432006
The provably total search problems of bounded arithmetic
A Skelley, N Thapen
Proceedings of the London Mathematical Society 103 (1), 106-138, 2011
37*2011
NP search problems in low fragments of bounded arithmetic
J KrajŪček, A Skelley, N Thapen
The Journal of Symbolic Logic 72 (02), 649-672, 2007
372007
Total space in resolution
I Bonacina, N Galesi, N Thapen
SIAM Journal on Computing 45 (5), 1894-1909, 2016
332016
The space complexity of cutting planes refutations
N Galesi, P PudlŠk, N Thapen
Proceedings of the 30th Conference on Computational Complexity, 433-447, 2015
222015
A Tradeoff Between Length and Width in Resolution
N Thapen
Theory of Computing 12 (5), 1-14, 2016
212016
A model-theoretic characterization of the weak pigeonhole principle
N Thapen
Annals of Pure and Applied Logic 118 (1), 175-195, 2002
212002
Fragments of approximate counting
SR Buss, LA Kołodziejczyk, N Thapen
The Journal of Symbolic Logic 79 (2), 496-525, 2014
18*2014
Parity games and propositional proofs
A Beckmann, P PudlŠk, N Thapen
ACM Transactions on Computational Logic (TOCL) 15 (2), 17, 2014
172014
The provably total NP search problems of weak second order bounded arithmetic
LA Kołodziejczyk, P Nguyen, N Thapen
Annals of Pure and Applied Logic 162 (6), 419-446, 2011
172011
The complexity of proving that a graph is Ramsey
M Lauria, P PudlŠk, V RŲdl, N Thapen
Combinatorica 37 (2), 253-268, 2017
122017
DRAT and Propagation Redundancy Proofs Without New Variables
N Thapen, S Buss
Logical Methods in Computer Science 17, 2021
11*2021
Alternating minima and maxima, Nash equilibria and bounded arithmetic
P PudlŠk, N Thapen
Annals of Pure and Applied Logic 163 (5), 604-614, 2012
82012
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
N Thapen
Archive for Mathematical Logic 50 (7-8), 665-680, 2011
82011
The weak pigeonhole principle in models of bounded arithmetic
N Thapen
University of Oxford, 2002
82002
Pink Trombone
N Thapen
7*2017
The Ordering Principle in a Fragment of Approximate Counting
A Atserias, N Thapen
ACM Transactions on Computational Logic (TOCL) 15 (4), 29, 2014
72014
Resolution and pebbling games
N Galesi, N Thapen
International Conference on Theory and Applications of Satisfiability†…, 2005
72005
Random resolution refutations
P PudlŠk, N Thapen
LIPIcs-Leibniz International Proceedings in Informatics 79, 2017
62017
The system can't perform the operation now. Try again later.
Articles 1–20