Neil Thapen

According to our database1, Neil Thapen authored at least 32 papers between 2002 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Feasible set functions have small circuits.
Computability, 2019

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

2017
Random Resolution Refutations.
Proceedings of the 32nd Computational Complexity Conference, 2017

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

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

2015
Space Complexity in Polynomial Calculus.
SIAM J. Comput., 2015

The Space Complexity of Cutting Planes Refutations.
Proceedings of the 30th Conference on Computational Complexity, 2015

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.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Total Space in Resolution.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Parity Games and Propositional Proofs.
Electronic Colloquium on Computational Complexity (ECCC), 2013

The Ordering Principle in a Fragment of Approximate Counting.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Parity Games and Propositional Proofs.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

The Complexity of Proving That a Graph Is Ramsey.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Space Complexity in Polynomial Calculus.
Electronic Colloquium on Computational Complexity (ECCC), 2012

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

Space Complexity in Polynomial Calculus.
Proceedings of the 27th Conference on Computational Complexity, 2012

How Much Randomness Is Needed for Statistics?
Proceedings of the How the World Computes, 2012

2011
The provably total NP search problems of weak second order bounded arithmetic.
Ann. Pure Appl. Logic, 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 V0.
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 V0.
Proceedings of the Computation and Logic in the Real World, 2007

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

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

Resolution and Pebbling Games.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004
Resolution and pebbling games
Electronic Colloquium on Computational Complexity (ECCC), 2004

The Strength of Replacement in Weak Arithmetic.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 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. Logic, 2002


  Loading...