Chris Pollett

According to our database1, Chris Pollett authored at least 25 papers between 1996 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
On the finite axiomatizability of.
Math. Log. Q., 2018

2017
Clustering-Based, Fully Automated Mixed-Bag Jigsaw Puzzle Solving.
Proceedings of the Computer Analysis of Images and Patterns, 2017

2011
Conservative fragments of S12 and R12.
Arch. Math. Log., 2011

2006
The weak pigeonhole principle for function classes in S12.
Math. Log. Q., 2006

Languages to diagonalize against advice classes.
Computational Complexity, 2006

2005
On the computational power of probabilistic and quantum branching program.
Inf. Comput., 2005

Stealthy Ciphertext.
Proceedings of The 2005 International Conference on Internet Computing, 2005

Circuit Principles and Weak Pigeonhole Variants.
Proceedings of the Theory of Computing 2005, 2005

2004
Minimization and NP multifunctions.
Theor. Comput. Sci., 2004

Languages to diagonalize against advice classes
Electronic Colloquium on Computational Complexity (ECCC), 2004

2003
A theory for Log-Space and NLIN versus coNLIN.
J. Symb. Log., 2003

Ordinal notations and well-orderings in bounded arithmetic.
Ann. Pure Appl. Logic, 2003

Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223].
Ann. Pure Appl. Logic, 2003

On the bounded version of Hilbert's tenth problem.
Arch. Math. Log., 2003

2002
Counting, fanout and the complexity of quantum ACC.
Quantum Information & Computation, 2002

Strengths and Weaknesses of LH Arithmetic.
Math. Log. Q., 2002

Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic
Electronic Colloquium on Computational Complexity (ECCC), 2002

Quantum and Stochastic Programs of Bounded Width
Electronic Colloquium on Computational Complexity (ECCC), 2002

Quantum and Stochastic Branching Programs of Bounded Width.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2000
Translating I-Delta0 + exp Proofs into Weaker Systems.
Math. Log. Q., 2000

Multifunction algebras and the provability of PH.
Ann. Pure Appl. Logic, 2000

On the Complexity of Quantum ACC.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999
Structure and Definability in General Bounded Arithmetic Theories.
Ann. Pure Appl. Logic, 1999

1998
On Proofs about Threshold Circuits and Counting Hierarchies.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1996
A propositional proof system for Ri2.
Proceedings of the Proof Complexity and Feasible Arithmetics, 1996


  Loading...