default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeil Thapen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j25]Fedor Part, Neil Thapen, Iddo Tzameret:
First-order reasoning and efficient semi-algebraic proofs. Ann. Pure Appl. Log. 176(1): 103496 (2025)- 2024
- [c16]Pavel Hubácek, Erfan Khaniki, Neil Thapen:
TFNP Intersections Through the Lens of Feasible Disjunction. ITCS 2024: 63:1-63:24 - [c15]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The Strength of the Dominance Rule. SAT 2024: 20:1-20:22 - [i19]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The strength of the dominance rule. CoRR abs/2406.13657 (2024) - [i18]Sam Buss, Neil Thapen:
A Simple Supercritical Tradeoff between Size and Height in Resolution. Electron. Colloquium Comput. Complex. TR24 (2024) - 2022
- [j24]Leszek Aleksander Kolodziejczyk, Neil Thapen:
Approximate counting and NP search problems. J. Math. Log. 22(3): 2250012:1-2250012:31 (2022) - [i17]Neil Thapen:
Notes on switching lemmas. CoRR abs/2202.05651 (2022) - [i16]Ilario Bonacina, Neil Thapen:
A separation of PLS from PPP. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j23]Sam Buss, Neil Thapen:
DRAT and Propagation Redundancy Proofs Without New Variables. Log. Methods Comput. Sci. 17(2) (2021) - [c14]Fedor Part, Neil Thapen, Iddo Tzameret:
First-Order Reasoning and Efficient Semi-Algebraic Proofs. LICS 2021: 1-13 - [i15]Fedor Part, Neil Thapen, Iddo Tzameret:
First-Order Reasoning and Efficient Semi-Algebraic Proofs. CoRR abs/2105.07531 (2021)
2010 – 2019
- 2019
- [j22]Pavel Pudlák, Neil Thapen:
Random resolution refutations. Comput. Complex. 28(2): 185-239 (2019) - [j21]Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen:
Feasible set functions have small circuits. Comput. 8(1): 67-98 (2019) - [c13]Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Polynomial Calculus Space and Resolution Width. FOCS 2019: 1325-1337 - [c12]Sam Buss, Neil Thapen:
DRAT Proofs, Propagation Redundancy, and Extended Resolution. SAT 2019: 71-89 - [i14]Sam Buss, Neil Thapen:
DRAT and Propagation Redundancy Proofs Without New Variables. CoRR abs/1909.00520 (2019) - [i13]Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Polynomial calculus space and resolution width. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j20]Massimo Lauria
, Neil Thapen:
On semantic cutting planes with very small coefficients. Inf. Process. Lett. 136: 70-75 (2018) - [i12]Leszek Aleksander Kolodziejczyk, Neil Thapen:
Approximate counting and NP search problems. CoRR abs/1812.10771 (2018) - 2017
- [j19]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Comb. 37(2): 253-268 (2017) - [c11]Pavel Pudlák, Neil Thapen:
Random Resolution Refutations. CCC 2017: 1:1-1:10 - 2016
- [j18]Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen:
Cobham recursive set functions. Ann. Pure Appl. Log. 167(3): 335-369 (2016) - [j17]Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total Space in Resolution. SIAM J. Comput. 45(5): 1894-1909 (2016) - [j16]Neil Thapen:
A Tradeoff Between Length and Width in Resolution. Theory Comput. 12(1): 1-14 (2016) - [i11]Pavel Pudlák, Neil Thapen:
Random resolution refutations. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j15]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. SIAM J. Comput. 44(4): 1119-1153 (2015) - [c10]Nicola Galesi, Pavel Pudlák, Neil Thapen:
The Space Complexity of Cutting Planes Refutations. CCC 2015: 433-447 - 2014
- [j14]Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen:
How much randomness is needed for statistics? Ann. Pure Appl. Log. 165(9): 1470-1483 (2014) - [j13]Samuel R. Buss, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Fragments of Approximate Counting. J. Symb. Log. 79(2): 496-525 (2014) - [j12]Arnold Beckmann, Pavel Pudlák, Neil Thapen:
Parity Games and Propositional Proofs. ACM Trans. Comput. Log. 15(2): 17:1-17:30 (2014) - [j11]Albert Atserias, Neil Thapen:
The Ordering Principle in a Fragment of Approximate Counting. ACM Trans. Comput. Log. 15(4): 29:1-29:11 (2014) - [c9]Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total Space in Resolution. FOCS 2014: 641-650 - [i10]Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total space in resolution. Electron. Colloquium Comput. Complex. TR14 (2014) - [i9]Nicola Galesi, Pavel Pudlák, Neil Thapen:
The space complexity of cutting planes refutations. Electron. Colloquium Comput. Complex. TR14 (2014) - [i8]Neil Thapen:
A trade-off between length and width in resolution. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c8]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The Complexity of Proving That a Graph Is Ramsey. ICALP (1) 2013: 684-695 - [c7]Arnold Beckmann, Pavel Pudlák, Neil Thapen:
Parity Games and Propositional Proofs. MFCS 2013: 111-122 - [i7]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. CoRR abs/1303.3166 (2013) - [i6]Albert Atserias, Neil Thapen:
The Ordering Principle in a Fragment of Approximate Counting. Electron. Colloquium Comput. Complex. TR13 (2013) - [i5]Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Electron. Colloquium Comput. Complex. TR13 (2013) - [i4]Pavel Pudlák, Arnold Beckmann, Neil Thapen:
Parity Games and Propositional Proofs. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j10]Pavel Pudlák, Neil Thapen:
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic. Ann. Pure Appl. Log. 163(5): 604-614 (2012) - [c6]Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen:
How Much Randomness Is Needed for Statistics? CiE 2012: 395-404 - [c5]Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi:
Space Complexity in Polynomial Calculus. CCC 2012: 334-344 - [i3]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j9]Neil Thapen:
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem. Arch. Math. Log. 50(7-8): 665-680 (2011) - [j8]Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen:
The provably total NP search problems of weak second order bounded arithmetic. Ann. Pure Appl. Log. 162(6): 419-446 (2011)
2000 – 2009
- 2009
- [j7]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The polynomial and linear time hierarchies in V0. Math. Log. Q. 55(5): 509-514 (2009) - 2008
- [j6]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails. J. Symb. Log. 73(2): 578-592 (2008) - 2007
- [j5]Jan Krajícek, Alan Skelley, Neil Thapen:
NP search problems in low fragments of bounded arithmetic. J. Symb. Log. 72(2): 649-672 (2007) - [c4]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The Polynomial and Linear Hierarchies in V0. CiE 2007: 408-415 - 2006
- [j4]Stephen A. Cook, Neil Thapen:
The strength of replacement in weak arithmetic. ACM Trans. Comput. Log. 7(4): 749-764 (2006) - 2005
- [j3]Neil Thapen, Michael Soltys:
Weak theories of linear algebra. Arch. Math. Log. 44(2): 195-208 (2005) - [j2]Neil Thapen:
Structures interpretable in models of bounded arithmetic. Ann. Pure Appl. Log. 136(3): 247-266 (2005) - [c3]Nicola Galesi, Neil Thapen:
Resolution and Pebbling Games. SAT 2005: 76-90 - 2004
- [c2]Nicola Galesi, Neil Thapen:
The Complexity of Treelike Systems over lamda-Local Formulae. CCC 2004: 68-74 - [c1]Stephen A. Cook, Neil Thapen:
The Strength of Replacement in Weak Arithmetic. LICS 2004: 256-264 - [i2]Stephen A. Cook, Neil Thapen:
The strength of replacement in weak arithmetic. CoRR cs.LO/0409015 (2004) - [i1]Nicola Galesi, Neil Thapen:
Resolution and pebbling games. Electron. Colloquium Comput. Complex. TR04 (2004) - 2002
- [j1]Neil Thapen:
A model-theoretic characterization of the weak pigeonhold principle. Ann. Pure Appl. Log. 118(1-2): 175-195 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
