Seguir
Neil Thapen
Neil Thapen
Researcher, Institute of Mathematics, Czech Academy of Sciences
Dirección de correo verificada de math.cas.cz - Página principal
Título
Citado por
Citado por
Año
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
582015
The provably total search problems of bounded arithmetic
A Skelley, N Thapen
Proceedings of the London Mathematical Society 103 (1), 106-138, 2011
44*2011
The strength of replacement in weak arithmetic
S Cook, N Thapen
ACM Transactions on Computational Logic (TOCL) 7 (4), 749-764, 2006
422006
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
402007
Total space in resolution
I Bonacina, N Galesi, N Thapen
SIAM Journal on Computing 45 (5), 1894-1909, 2016
342016
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
252015
A Tradeoff Between Length and Width in Resolution
N Thapen
Theory of Computing 12 (5), 1-14, 2016
242016
Fragments of approximate counting
SR Buss, LA Kołodziejczyk, N Thapen
The Journal of Symbolic Logic 79 (2), 496-525, 2014
232014
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
222011
A model-theoretic characterization of the weak pigeonhole principle
N Thapen
Annals of Pure and Applied Logic 118 (1), 175-195, 2002
222002
DRAT and Propagation Redundancy Proofs Without New Variables
N Thapen, S Buss
Logical Methods in Computer Science 17, 2021
21*2021
Parity games and propositional proofs
A Beckmann, P Pudlák, N Thapen
ACM Transactions on Computational Logic (TOCL) 15 (2), 17, 2014
182014
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
172017
Resolution and pebbling games
N Galesi, N Thapen
International Conference on Theory and Applications of Satisfiability …, 2005
112005
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
102011
Pink Trombone
N Thapen
9*2017
Random resolution refutations
P Pudlák, N Thapen
LIPIcs-Leibniz International Proceedings in Informatics 79, 2017
92017
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
92012
Notes on switching lemmas
N Thapen
arXiv preprint arXiv:2202.05651, 2022
82022
Polynomial calculus space and resolution width
N Galesi, L Kolodziejczyk, N Thapen
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
82019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20