Neil Thapen

Generating author description...

All published works

Action	Title	Year	Authors
+	First-order reasoning and efficient semi-algebraic proofs	2024	Fedor Part Neil Thapen Iddo Tzameret
+ PDF Chat	The strength of the dominance rule	2024	Leszek Aleksander Kołodziejczyk Neil Thapen
+ PDF Chat	Approximate counting and NP search problems	2022	Leszek Aleksander Kołodziejczyk Neil Thapen
+	Notes on switching lemmas	2022	Neil Thapen
+ PDF Chat	First-Order Reasoning and Efficient Semi-Algebraic Proofs	2021	Fedor Part Neil Thapen Iddo Tzameret
+	First-Order Reasoning and Efficient Semi-Algebraic Proofs	2021	Fedor Part Neil Thapen Iddo Tzameret
+ PDF Chat	Polynomial Calculus Space and Resolution Width	2019	Nicola Galesi Leszek Aleksander Kołodziejczyk Neil Thapen
+	DRAT and Propagation Redundancy Proofs Without New Variables	2019	Sam Buss Neil Thapen
+	Polynomial calculus space and resolution width.	2019	Nicola Galesi Leszek Aleksander Kołodziejczyk Neil Thapen
+	DRAT and Propagation Redundancy Proofs Without New Variables.	2019	Sam Buss Neil Thapen
+ PDF Chat	Feasible set functions have small circuits	2018	Arnold Beckmann Sam Buss Sy‐David Friedman Moritz Müller Neil Thapen
+	Approximate counting and NP search problems	2018	Leszek Aleksander Kołodziejczyk Neil Thapen
+	Random resolution refutations	2017	Pavel Pudlák Neil Thapen
+ PDF Chat	COBHAM RECURSIVE SET FUNCTIONS AND WEAK SET THEORIES	2017	Arnold Beckmann Sam Buss Sy‐David Friedman Moritz Müller Neil Thapen
+ PDF Chat	The complexity of proving that a graph is Ramsey	2016	Massimo Lauria Pavel Pudlák Vojtěch Rödl Neil Thapen
+ PDF Chat	None	2016	Neil Thapen
+	Cobham recursive set functions	2015	Arnold Beckmann Sam Buss Sy‐David Friedman Moritz Müller Neil Thapen
+	Total Space in Resolution	2014	Ilario Bonacina Nicola Galesi Neil Thapen
+ PDF Chat	The Ordering Principle in a Fragment of Approximate Counting	2014	Albert Atserias Neil Thapen
+	How much randomness is needed for statistics?	2014	Bjørn Kjos-Hanssen Antoine Taveneaux Neil Thapen
+	Total space in resolution.	2014	Ilario Bonacina Nicola Galesi Neil Thapen
+	The complexity of proving that a graph is Ramsey	2013	Massimo Lauria Pavel Pudlák Vojtěch Rödl Neil Thapen
+ PDF Chat	The Complexity of Proving That a Graph Is Ramsey	2013	Massimo Lauria Pavel Pudlák Vojtěch Rödl Neil Thapen
+	The Ordering Principle in a Fragment of Approximate Counting.	2013	Albert Atserias Neil Thapen
+	The complexity of proving that a graph is Ramsey.	2013	Massimo Lauria Pavel Pudlák Vojtěch Rödl Neil Thapen
+	The complexity of proving that a graph is Ramsey	2013	Massimo Lauria Pavel Pudlák Vojtěch Rödl Neil Thapen
+ PDF Chat	How Much Randomness Is Needed for Statistics?	2012	Bjørn Kjos-Hanssen Antoine Taveneaux Neil Thapen
+ PDF Chat	The strength of replacement in weak arithmetic	2006	Stephen Cook Neil Thapen
+ PDF Chat	The strength of replacement in weak arithmetic	2006	Stephen Cook Neil Thapen
+ PDF Chat	A note on Δ<sub>1</sub>induction and Σ<sub>1</sub>collection	2005	Neil Thapen
+ PDF Chat	The strength of replacement in weak arithmetic	2004	Stephen Cook Neil Thapen
+	The strength of replacement in weak arithmetic	2004	Stephen A. Cook Neil Thapen

Common Coauthors

Coauthor	Papers Together
Pavel Pudlák	6
Vojtěch Rödl	5
Leszek Aleksander Kołodziejczyk	5
Sam Buss	5
Massimo Lauria	5
Nicola Galesi	4
Stephen A. Cook	4
Iddo Tzameret	3
Sy‐David Friedman	3
Moritz Müller	3
Fedor Part	3
Arnold Beckmann	3
Antoine Taveneaux	2
Bjørn Kjos-Hanssen	2
Albert Atserias	2
Ilario Bonacina	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	On the weak pigeonhole principle	2001	Jan Krajı́ček	5
+	Ramsey's theorem in bounded arithmetic	1991	Pavel Pudlák	4
+ PDF Chat	A lower bound on the size of resolution proofs of the Ramsey theorem	2012	Pavel Pudlák	3
+	Non-Ramsey Graphs Are clogn-Universal	1999	Hans Jürgen Prömel Vojtěch Rödl	3
+	Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs	1996	Paul Beame Russell Impagliazzo Jan Krajı́ček Toniann Pitassi Pavel Pudlák	3
+ PDF Chat	Paris-Harrington Tautologies	2011	Lorenzo Carlucci Nicola Galesi Massimo Lauria	3
+ PDF Chat	Predicatively computable functions on sets	2015	Toshiyasu Arai	3
+ PDF Chat	Some remarks on the theory of graphs	1947	P. Erdős	3
+ PDF Chat	Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution	2011	Albert Atserias Johannes K. Fichte Marc Thurley	3
+	Examples of hard tautologies in the propositional calculus	1981	Balakrishnan Krishnamurthy Robert N. Moll	3
+ PDF Chat	A Combinatorial Problem in Geometry	2009	P. Erdős G. Szckeres	2
+ PDF Chat	Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds	2013	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals	2
+	Metamathematics of First-Order Arithmetic	1993	Petr Hájek Pavel Pudlák	2
+	Erdõs on Graphs : His Legacy of Unsolved Problems	1999	Fan Chung Ronald Graham	2
+ PDF Chat	Algorithmic tests and randomness with respect to a class of measures	2011	Laurent Bienvenu Péter Gács Mathieu Hoyrup Cristóbal Rojas Alexander Shen	2
+	Relating the bounded arithmetic and polynomial time hierarchies	1995	Samuel R. Buss	2
+ PDF Chat	Hypercontractivity, sum-of-squares proofs, and their applications	2012	Boaz Barak Fernando G. S. L. Brandão Aram W. Harrow Jonathan A. Kelner David Steurer Yuan Zhou	2
+ PDF Chat	A new upper bound for diagonal Ramsey numbers	2009	David Conlon	2
+	Existence and feasibility in arithmetic	1971	Rohit Parikh	2
+ PDF Chat	A note on propositional proof complexity of some Ramsey-type statements	2010	Jan Krajı́ček	2
+	Stable sets and polynomials	1994	László Lovász	2
+	Asymptotic lower bounds for Ramsey functions	1977	Joel Spencer	2
+	Witnessing functions in bounded arithmetic and search problems	1998	Mario Chiari Jan Krajı́ček	2
+	Kolmogorov–Loveland randomness and stochasticity	2005	Wolfgang Merkle Joseph S. Miller André Nies Jan Reimann Frank Stephan	2
+	A note on Ramsey numbers	1980	Miklós Ajtai János Komlós Endre Szemerédi	2
+	Complexity of Null- and Positivstellensatz proofs	2001	Dima Grigoriev Nicolai Vorobjov	2
+ PDF Chat	Constructive Dimension and Turing Degrees	2009	Laurent Bienvenu David Doty Frank Stephan	2
+ PDF Chat	Algebraic proof systems over formulas	2003	Dima Grigoriev Edward Hirsch	2
+ PDF Chat	Short Propositional Refutations for Dense Random 3CNF Formulas	2012	Sebastian Müller Iddo Tzameret	2
+	The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i>	1995	Jeong Han Kim	2
+	Resource bounded randomness and computational complexity	2000	Yongge Wang	2
+	Mathematical metaphysics of randomness	1998	Andrei A. Muchnik A. L. Semenov Vladimir Uspensky	2
+	On Bounded Set Theory	1997	Vladimir Sazonov	2
+ PDF Chat	From Small Space to Small Width in Resolution	2015	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals	2
+	The probability distribution as a computational resource for randomness testing	2010	Hanssen	2
+	An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle	1995	Jan Krajı́ček Pavel Pudlák Alan R. Woods	2
+ PDF Chat	Approximate counting by hashing in bounded arithmetic	2009	Emil Jeřábek	2
+	Provability of the pigeonhole principle and the existence of infinitely many primes	1988	J. B. Paris A. J. Wilkie Alan R. Woods	2
+	Cobham recursive set functions	2015	Arnold Beckmann Sam Buss Sy‐David Friedman Moritz Müller Neil Thapen	2
+ PDF Chat	Infinite time Turing machines	2000	Joel David Hamkins Andy Lewis	2
+	SOS is not obviously automatizable, even approximately.	2016	Ryan O’Donnell	2
+	The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs.	2018	Christoph Berkholz	2
+	A Lower Bound for Polynomial Calculus with Extension Rule	2020	Yaroslav Alekseev	2
+ PDF Chat	Pebble Games, Proof Complexity, and Time-Space Trade-offs	2013	Jakob Nordström	2
+ PDF Chat	The early evolution of the H-free process	2010	Tom Bohman Peter Keevash	2
+	An Equivalence between Second Order Bounded Domain Bounded Arithmetic and First Order Bounded Arithmetic	1993	Alexander Razborov	2
+ PDF Chat	How Much Randomness Is Needed for Statistics?	2012	Bjørn Kjos-Hanssen Antoine Taveneaux Neil Thapen	1
+	Parity and the Pigeonhole Principle	1990	Miklós Ajtai	1
+	Basic Abstract Algebra: For Graduate Students and Advanced Undergraduates	2006	Robert B. Ash	1
+	The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences	2003	Wolfgang Merkle	1