The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chris Pollett: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Chris Pollett, Norman Danner
    Circuit Principles and Weak Pigeonhole Variants. [Citation Graph (0, 0)][DBLP]
    CATS, 2005, pp:31-40 [Conf]
  2. Frederic Green, Steven Homer, Chris Pollett
    On the Complexity of Quantum ACC. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:250-262 [Conf]
  3. Martina Simova, Mark Stamp, Chris Pollett
    Stealthy Ciphertext. [Citation Graph (0, 0)][DBLP]
    International Conference on Internet Computing, 2005, pp:380-388 [Conf]
  4. Farid M. Ablayev, Cristopher Moore, Chris Pollett
    Quantum and Stochastic Branching Programs of Bounded Width. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:343-354 [Conf]
  5. Jan Johannsen, Chris Pollett
    On Proofs about Threshold Circuits and Counting Hierarchies. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:444-452 [Conf]
  6. Chris Pollett
    On the bounded version of Hilbert's tenth problem. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:5, pp:469-488 [Journal]
  7. Arnold Beckmann, Samuel R. Buss, Chris Pollett
    Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223]. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:123, n:1-3, pp:291-0 [Journal]
  8. Arnold Beckmann, Chris Pollett, Samuel R. Buss
    Ordinal notations and well-orderings in bounded arithmetic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:120, n:1-3, pp:197-223 [Journal]
  9. Chris Pollett
    Multifunction algebras and the provability of PH. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:279-302 [Journal]
  10. Chris Pollett
    Structure and Definability in General Bounded Arithmetic Theories. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:100, n:1-3, pp:189-245 [Journal]
  11. Chris Pollett
    Languages to diagonalize against advice classes. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:14, n:4, pp:341-361 [Journal]
  12. Chris Pollett, Farid M. Ablayev, Cristopher Moore
    Quantum and Stochastic Programs of Bounded Width [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:013, pp:- [Journal]
  13. Chris Pollett
    Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:051, pp:- [Journal]
  14. Chris Pollett
    Languages to diagonalize against advice classes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:014, pp:- [Journal]
  15. Chris Pollett
    Translating I-Delta0 + exp Proofs into Weaker Systems. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:2, pp:249-256 [Journal]
  16. Chris Pollett, Randall Pruim
    Strengths and Weaknesses of LH Arithmetic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:2, pp:221-243 [Journal]
  17. Norman Danner, Chris Pollett
    Minimization and NP multifunctions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:105-119 [Journal]
  18. Norman Danner, Chris Pollett
    The weak pigeonhole principle for function classes in S^1_2 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  19. Chris Pollett, Norman Danner
    Circuit principles and weak pigeonhole variants. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:2-3, pp:115-131 [Journal]

  20. Alternating Hierarchies for Time-Space Tradeoffs [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002