Search the dblp DataBase

Publications of Author

1. Nicola Galesi, Neil Thapen
   The Complexity of Treelike Systems over lamda-Local Formulae. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2004, pp:68-74 [Conf]
   
2. Stephen A. Cook, Neil Thapen
   The Strength of Replacement in Weak Arithmetic. [Citation Graph (0, 0)][DBLP]
   LICS, 2004, pp:256-264 [Conf]
   
3. Nicola Galesi, Neil Thapen
   Resolution and Pebbling Games. [Citation Graph (0, 0)][DBLP]
   SAT, 2005, pp:76-90 [Conf]
   
4. Neil Thapen, Michael Soltys
   Weak theories of linear algebra. [Citation Graph (0, 0)][DBLP]
   Arch. Math. Log., 2005, v:44, n:2, pp:195-208 [Journal]
   
5. Neil Thapen
   A model-theoretic characterization of the weak pigeonhold principle. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2002, v:118, n:1-2, pp:175-195 [Journal]
   
6. Neil Thapen
   Structures interpretable in models of bounded arithmetic. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2005, v:136, n:3, pp:247-266 [Journal]
   
7. Stephen A. Cook, Neil Thapen
   The strength of replacement in weak arithmetic [Citation Graph (0, 0)][DBLP]
   CoRR, 2004, v:0, n:, pp:- [Journal]
   
8. Nicola Galesi, Neil Thapen
   Resolution and pebbling games [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:112, pp:- [Journal]
   
9. Stephen A. Cook, Neil Thapen
   The strength of replacement in weak arithmetic. [Citation Graph (0, 0)][DBLP]
   ACM Trans. Comput. Log., 2006, v:7, n:4, pp:749-764 [Journal]
   
10. Leszek Aleksander Kolodziejczyk, Neil Thapen
    The Polynomial and Linear Hierarchies in V⁰. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:408-415 [Conf]