| 2008 |
|---|
| 22 | EE | Chris Pollett,
Eric Miles:
Alternating Hierarchies for Time-Space Tradeoffs
CoRR abs/0801.1307: (2008) |
| 2007 |
|---|
| 21 | EE | Chris Pollett,
Norman Danner:
Circuit principles and weak pigeonhole variants.
Theor. Comput. Sci. 383(2-3): 115-131 (2007) |
| 2006 |
|---|
| 20 | EE | Norman Danner,
Chris Pollett:
The weak pigeonhole principle for function classes in S^1_2
CoRR abs/cs/0608039: (2006) |
| 19 | EE | Chris Pollett:
Languages to diagonalize against advice classes.
Computational Complexity 14(4): 341-361 (2006) |
| 18 | EE | Norman Danner,
Chris Pollett:
The weak pigeonhole principle for function classes in S12.
Math. Log. Q. 52(6): 575-584 (2006) |
| 2005 |
|---|
| 17 | EE | Chris Pollett,
Norman Danner:
Circuit Principles and Weak Pigeonhole Variants.
CATS 2005: 31-40 |
| 16 | | Martina Simova,
Mark Stamp,
Chris Pollett:
Stealthy Ciphertext.
International Conference on Internet Computing 2005: 380-388 |
| 15 | EE | Farid M. Ablayev,
Aida Gainutdinova,
Marek Karpinski,
Cristopher Moore,
Chris Pollett:
On the computational power of probabilistic and quantum branching program.
Inf. Comput. 203(2): 145-162 (2005) |
| 2004 |
|---|
| 14 | EE | Chris Pollett:
Languages to diagonalize against advice classes
Electronic Colloquium on Computational Complexity (ECCC)(014): (2004) |
| 13 | EE | Norman Danner,
Chris Pollett:
Minimization and NP multifunctions.
Theor. Comput. Sci. 318(1-2): 105-119 (2004) |
| 2003 |
|---|
| 12 | | Arnold Beckmann,
Chris Pollett,
Samuel R. Buss:
Ordinal notations and well-orderings in bounded arithmetic.
Ann. Pure Appl. Logic 120(1-3): 197-223 (2003) |
| 11 | EE | 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].
Ann. Pure Appl. Logic 123(1-3): 291- (2003) |
| 10 | EE | Chris Pollett:
On the bounded version of Hilbert's tenth problem.
Arch. Math. Log. 42(5): 469-488 (2003) |
| 2002 |
|---|
| 9 | EE | Farid M. Ablayev,
Cristopher Moore,
Chris Pollett:
Quantum and Stochastic Branching Programs of Bounded Width.
ICALP 2002: 343-354 |
| 8 | EE | Chris Pollett,
Farid M. Ablayev,
Cristopher Moore:
Quantum and Stochastic Programs of Bounded Width
Electronic Colloquium on Computational Complexity (ECCC)(013): (2002) |
| 7 | EE | Chris Pollett:
Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic
Electronic Colloquium on Computational Complexity (ECCC)(051): (2002) |
| 6 | EE | Chris Pollett,
Randall Pruim:
Strengths and Weaknesses of LH Arithmetic.
Math. Log. Q. 48(2): 221-243 (2002) |
| 2000 |
|---|
| 5 | EE | Frederic Green,
Steven Homer,
Chris Pollett:
On the Complexity of Quantum ACC.
IEEE Conference on Computational Complexity 2000: 250-262 |
| 4 | | Chris Pollett:
Multifunction algebras and the provability of PH.
Ann. Pure Appl. Logic 104(1-3): 279-302 (2000) |
| 3 | EE | Chris Pollett:
Translating I-Delta0 + exp Proofs into Weaker Systems.
Math. Log. Q. 46(2): 249-256 (2000) |
| 1999 |
|---|
| 2 | | Chris Pollett:
Structure and Definability in General Bounded Arithmetic Theories.
Ann. Pure Appl. Logic 100(1-3): 189-245 (1999) |
| 1998 |
|---|
| 1 | | Jan Johannsen,
Chris Pollett:
On Proofs about Threshold Circuits and Counting Hierarchies.
LICS 1998: 444-452 |
