The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Neil Thapen" ( http://dblp.L3S.de/Authors/Neil_Thapen )

  Author page on DBLP  Author page in RDF  Community of Neil Thapen in ASPL-2

Publication years (Num. hits)
2002-2011 (15) 2012 (1)
Publication types (Num. hits)
article(12) inproceedings(4)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 3 keywords

Results
Found 16 publication records. Showing 16 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Pavel Pudlák, Neil Thapen Alternating minima and maxima, Nash equilibria and Bounded Arithmetic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen The provably total NP search problems of weak second order bounded arithmetic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Neil Thapen Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Leszek Aleksander Kolodziejczyk, Neil Thapen The polynomial and linear time hierarchies in V0. Search on Bibsonomy Math. Log. Q. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Leszek Aleksander Kolodziejczyk, Neil Thapen The polynomial and linear hierarchies in models where the weak pigeonhole principle fails. Search on Bibsonomy J. Symb. Log. The full citation details ... 2008 DBLP  BibTeX  RDF
1Jan Krajícek, Alan Skelley, Neil Thapen NP search problems in low fragments of bounded arithmetic. Search on Bibsonomy J. Symb. Log. The full citation details ... 2007 DBLP  BibTeX  RDF
1Leszek Aleksander Kolodziejczyk, Neil Thapen The Polynomial and Linear Hierarchies in V0. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF prefix parity, linear hierarchy, bounded depth circuits, bounded arithmetic
1Stephen A. Cook, Neil Thapen The strength of replacement in weak arithmetic. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF cryptography, PV, Bounded arithmetic
1Neil Thapen Structures interpretable in models of bounded arithmetic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Neil Thapen, Michael Soltys Weak theories of linear algebra. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Nicola Galesi, Neil Thapen Resolution and Pebbling Games. Search on Bibsonomy SAT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Nicola Galesi, Neil Thapen Resolution and pebbling games Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Stephen A. Cook, Neil Thapen The strength of replacement in weak arithmetic Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Stephen A. Cook, Neil Thapen The Strength of Replacement in Weak Arithmetic. Search on Bibsonomy LICS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Nicola Galesi, Neil Thapen The Complexity of Treelike Systems over lamda-Local Formulae. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Neil Thapen A model-theoretic characterization of the weak pigeonhold principle. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #16 of 16 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.