Neil Thapen

Publication Activity (10 Years)

Years Active: 2002-2025
Publications (10 Years): 25

Top Topics

Space Complexity

Search Problems

Mathematical Proofs

Top Venues

Electron. Colloquium Comput. Complex.

Ann. Pure Appl. Log.

Publications

Fedor Part, Neil Thapen, Iddo Tzameret
First-order reasoning and efficient semi-algebraic proofs. Ann. Pure Appl. Log. 176 (1) (2025)
Leszek Aleksander Kolodziejczyk, Neil Thapen
The strength of the dominance rule. CoRR (2024)
Leszek Aleksander Kolodziejczyk, Neil Thapen
The Strength of the Dominance Rule. SAT (2024)
Sam Buss, Neil Thapen
A Simple Supercritical Tradeoff between Size and Height in Resolution. Electron. Colloquium Comput. Complex. (2024)
Pavel Hubácek, Erfan Khaniki, Neil Thapen
TFNP Intersections Through the Lens of Feasible Disjunction. ITCS (2024)
Leszek Aleksander Kolodziejczyk, Neil Thapen
Approximate counting and NP search problems. J. Math. Log. 22 (3) (2022)
Ilario Bonacina, Neil Thapen
A separation of PLS from PPP. Electron. Colloquium Comput. Complex. (2022)
Neil Thapen
Notes on switching lemmas. CoRR (2022)
Fedor Part, Neil Thapen, Iddo Tzameret
First-Order Reasoning and Efficient Semi-Algebraic Proofs. LICS (2021)
Fedor Part, Neil Thapen, Iddo Tzameret
First-Order Reasoning and Efficient Semi-Algebraic Proofs. CoRR (2021)
Sam Buss, Neil Thapen
DRAT and Propagation Redundancy Proofs Without New Variables. Log. Methods Comput. Sci. 17 (2) (2021)
Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen
Polynomial Calculus Space and Resolution Width. FOCS (2019)
Pavel Pudlák, Neil Thapen
Random resolution refutations. Comput. Complex. 28 (2) (2019)
Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen
Polynomial calculus space and resolution width. Electron. Colloquium Comput. Complex. 26 (2019)
Sam Buss, Neil Thapen
DRAT Proofs, Propagation Redundancy, and Extended Resolution. SAT (2019)
Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen
Feasible set functions have small circuits. Comput. 8 (1) (2019)
Sam Buss, Neil Thapen
DRAT and Propagation Redundancy Proofs Without New Variables. CoRR (2019)
Leszek Aleksander Kolodziejczyk, Neil Thapen
Approximate counting and NP search problems. CoRR (2018)
Massimo Lauria, Neil Thapen
On semantic cutting planes with very small coefficients. Inf. Process. Lett. 136 (2018)
Pavel Pudlák, Neil Thapen
Random Resolution Refutations. Computational Complexity Conference (2017)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
The complexity of proving that a graph is Ramsey. Comb. 37 (2) (2017)
Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen
Cobham recursive set functions. Ann. Pure Appl. Log. 167 (3) (2016)
Ilario Bonacina, Nicola Galesi, Neil Thapen
Total Space in Resolution. SIAM J. Comput. 45 (5) (2016)
Pavel Pudlák, Neil Thapen
Random resolution refutations. Electron. Colloquium Comput. Complex. 23 (2016)
Neil Thapen
A Tradeoff Between Length and Width in Resolution. Theory Comput. 12 (1) (2016)
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
Space Complexity in Polynomial Calculus. SIAM J. Comput. 44 (4) (2015)
Nicola Galesi, Pavel Pudlák, Neil Thapen
The Space Complexity of Cutting Planes Refutations. Computational Complexity Conference (2015)
Ilario Bonacina, Nicola Galesi, Neil Thapen
Total space in resolution. Electron. Colloquium Comput. Complex. 21 (2014)
Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen
How much randomness is needed for statistics? Ann. Pure Appl. Log. 165 (9) (2014)
Albert Atserias, Neil Thapen
The Ordering Principle in a Fragment of Approximate Counting. ACM Trans. Comput. Log. 15 (4) (2014)
Neil Thapen
A trade-off between length and width in resolution. Electron. Colloquium Comput. Complex. 21 (2014)
Arnold Beckmann, Pavel Pudlák, Neil Thapen
Parity Games and Propositional Proofs. ACM Trans. Comput. Log. 15 (2) (2014)
Samuel R. Buss, Leszek Aleksander Kolodziejczyk, Neil Thapen
Fragments of Approximate Counting. J. Symb. Log. 79 (2) (2014)
Nicola Galesi, Pavel Pudlák, Neil Thapen
The space complexity of cutting planes refutations. Electron. Colloquium Comput. Complex. 21 (2014)
Ilario Bonacina, Nicola Galesi, Neil Thapen
Total Space in Resolution. FOCS (2014)
Pavel Pudlák, Arnold Beckmann, Neil Thapen
Parity Games and Propositional Proofs. Electron. Colloquium Comput. Complex. 20 (2013)
Arnold Beckmann, Pavel Pudlák, Neil Thapen
Parity Games and Propositional Proofs. MFCS (2013)
Albert Atserias, Neil Thapen
The Ordering Principle in a Fragment of Approximate Counting. Electron. Colloquium Comput. Complex. 20 (2013)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
The Complexity of Proving That a Graph Is Ramsey. ICALP (1) (2013)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
The complexity of proving that a graph is Ramsey. Electron. Colloquium Comput. Complex. 20 (2013)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
The complexity of proving that a graph is Ramsey CoRR (2013)
Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen
How Much Randomness Is Needed for Statistics? CiE (2012)
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
Space Complexity in Polynomial Calculus. Electron. Colloquium Comput. Complex. 19 (2012)
Pavel Pudlák, Neil Thapen
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic. Ann. Pure Appl. Log. 163 (5) (2012)
Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi
Space Complexity in Polynomial Calculus. Computational Complexity Conference (2012)
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen
The provably total NP search problems of weak second order bounded arithmetic. Ann. Pure Appl. Log. 162 (6) (2011)
Neil Thapen
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem. Arch. Math. Log. 50 (7-8) (2011)
Leszek Aleksander Kolodziejczyk, Neil Thapen
. Math. Log. Q. 55 (5) (2009)
Leszek Aleksander Kolodziejczyk, Neil Thapen
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails. J. Symb. Log. 73 (2) (2008)
Leszek Aleksander Kolodziejczyk, Neil Thapen
. CiE (2007)
Jan Krajícek, Alan Skelley, Neil Thapen
NP search problems in low fragments of bounded arithmetic. J. Symb. Log. 72 (2) (2007)
Stephen A. Cook, Neil Thapen
The strength of replacement in weak arithmetic. ACM Trans. Comput. Log. 7 (4) (2006)
Neil Thapen, Michael Soltys
Weak theories of linear algebra. Arch. Math. Log. 44 (2) (2005)
Nicola Galesi, Neil Thapen
Resolution and Pebbling Games. SAT (2005)
Neil Thapen
Structures interpretable in models of bounded arithmetic. Ann. Pure Appl. Log. 136 (3) (2005)
Nicola Galesi, Neil Thapen
The Complexity of Treelike Systems over lamda-Local Formulae. Computational Complexity Conference (2004)
Stephen A. Cook, Neil Thapen
The strength of replacement in weak arithmetic CoRR (2004)
Stephen A. Cook, Neil Thapen
The Strength of Replacement in Weak Arithmetic. LICS (2004)
Nicola Galesi, Neil Thapen
Resolution and pebbling games Electron. Colloquium Comput. Complex. (112) (2004)
Neil Thapen
A model-theoretic characterization of the weak pigeonhold principle. Ann. Pure Appl. Log. 118 (1-2) (2002)