Neil Thapen

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