Neil Thapen

According to our database1, Neil Thapen authored at least 37 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Simple Supercritical Tradeoff between Size and Height in Resolution.
Electron. Colloquium Comput. Complex., 2024

The strength of the dominance rule.
CoRR, 2024

TFNP Intersections Through the Lens of Feasible Disjunction.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2022
Approximate counting and NP search problems.
J. Math. Log., 2022

A separation of PLS from PPP.
Electron. Colloquium Comput. Complex., 2022

Notes on switching lemmas.
CoRR, 2022

2021
DRAT and Propagation Redundancy Proofs Without New Variables.
Log. Methods Comput. Sci., 2021

First-Order Reasoning and Efficient Semi-Algebraic Proofs.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2019
Polynomial calculus space and resolution width.
Electron. Colloquium Comput. Complex., 2019

Feasible set functions have small circuits.
Comput., 2019

Random resolution refutations.
Comput. Complex., 2019

DRAT Proofs, Propagation Redundancy, and Extended Resolution.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018
On semantic cutting planes with very small coefficients.
Inf. Process. Lett., 2018

2017
The complexity of proving that a graph is Ramsey.
Comb., 2017

2016
A Tradeoff Between Length and Width in Resolution.
Theory Comput., 2016

Cobham recursive set functions.
Ann. Pure Appl. Log., 2016

2014
Parity Games and Propositional Proofs.
ACM Trans. Comput. Log., 2014

The Ordering Principle in a Fragment of Approximate Counting.
ACM Trans. Comput. Log., 2014

Fragments of Approximate Counting.
J. Symb. Log., 2014

A trade-off between length and width in resolution.
Electron. Colloquium Comput. Complex., 2014

The space complexity of cutting planes refutations.
Electron. Colloquium Comput. Complex., 2014

Total space in resolution.
Electron. Colloquium Comput. Complex., 2014

How much randomness is needed for statistics?
Ann. Pure Appl. Log., 2014

2012
Space Complexity in Polynomial Calculus.
Electron. Colloquium Comput. Complex., 2012

Alternating minima and maxima, Nash equilibria and Bounded Arithmetic.
Ann. Pure Appl. Log., 2012

2011
The provably total NP search problems of weak second order bounded arithmetic.
Ann. Pure Appl. Log., 2011

Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.
Arch. Math. Log., 2011

2009
The polynomial and linear time hierarchies in V<sup>0</sup>.
Math. Log. Q., 2009

2008
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails.
J. Symb. Log., 2008

2007
NP search problems in low fragments of bounded arithmetic.
J. Symb. Log., 2007

The Polynomial and Linear Hierarchies in V<sup>0</sup>.
Proceedings of the Computation and Logic in the Real World, 2007

2006
The strength of replacement in weak arithmetic.
ACM Trans. Comput. Log., 2006

2005
Structures interpretable in models of bounded arithmetic.
Ann. Pure Appl. Log., 2005

Weak theories of linear algebra.
Arch. Math. Log., 2005

2004
Resolution and pebbling games
Electron. Colloquium Comput. Complex., 2004

The Complexity of Treelike Systems over lamda-Local Formulae.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2002
A model-theoretic characterization of the weak pigeonhold principle.
Ann. Pure Appl. Log., 2002


  Loading...