Neil Thapen

Available identifiers

zbMath Open thapen.neilWikidataQ102165478 ScholiaQ102165478MaRDI QIDQ647333

List of research outcomes

Publication	Date of Publication	Type
First-order reasoning and efficient semi-algebraic proofs	2024-10-07	Paper
Approximate counting and NP search problems	2022-12-13	Paper
Notes on switching lemmas	2022-02-11	Paper
https://portal.mardi4nfdi.de/entity/Q4989407	2021-05-25	Paper
COBHAM RECURSIVE SET FUNCTIONS AND WEAK SET THEORIES	2020-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q5111131	2020-05-26	Paper
DRAT proofs, propagation redundancy, and extended resolution	2020-05-20	Paper
Feasible set functions have small circuits	2019-10-28	Paper
DRAT and Propagation Redundancy Proofs Without New Variables	2019-09-01	Paper
Random resolution refutations	2019-07-10	Paper
On semantic cutting planes with very small coefficients	2018-05-25	Paper
The complexity of proving that a graph is Ramsey	2018-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4601841	2018-01-24	Paper
The strength of replacement in weak arithmetic	2017-07-12	Paper
Total space in resolution	2016-10-28	Paper
A tradeoff between length and width in resolution	2016-08-22	Paper
Cobham recursive set functions	2016-01-12	Paper
The Ordering Principle in a Fragment of Approximate Counting	2015-09-17	Paper
Space Complexity in Polynomial Calculus	2015-09-02	Paper
Fragments of approximate counting	2014-09-30	Paper
Parity Games and Propositional Proofs	2014-07-17	Paper
How much randomness is needed for statistics?	2014-06-06	Paper
Parity Games and Propositional Proofs	2013-09-20	Paper
The complexity of proving that a graph is Ramsey	2013-08-06	Paper
How much randomness is needed for statistics?	2012-08-14	Paper
Alternating minima and maxima, Nash equilibria and bounded arithmetic	2012-03-13	Paper
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem	2011-11-23	Paper
The provably total search problems of bounded arithmetic	2011-07-27	Paper
The polynomial and linear time hierarchies in V⁰	2009-10-14	Paper
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails	2008-06-09	Paper
The Polynomial and Linear Hierarchies in V0	2007-11-13	Paper
NP search problems in low fragments of bounded arithmetic	2007-07-09	Paper
Theory and Applications of Satisfiability Testing	2005-12-15	Paper
Structures interpretable in models of bounded arithmetic	2005-10-26	Paper
A note on Δ₁induction and Σ₁collection	2005-09-29	Paper
Weak theories of linear algebra	2005-03-02	Paper
A model-theoretic characterization of the weak pigeonhole principle	2002-12-02	Paper

Research outcomes over time

This page was built for person: Neil Thapen