Obserwuj
Alan Skelley
Alan Skelley
Zweryfikowany adres z google.com
Tytuł
Cytowane przez
Cytowane przez
Rok
DB2 advisor: An optimizer smart enough to recommend its own indexes
G Valentin, M Zuliani, DC Zilio, G Lohman, A Skelley
Proceedings of 16th International Conference on Data Engineering (Cat. No …, 2000
4112000
NP search problems in low fragments of bounded arithmetic
J Krajíček, A Skelley, N Thapen
The Journal of Symbolic Logic 72 (2), 649-672, 2007
392007
The provably total search problems of bounded arithmetic
A Skelley, N Thapen
Proceedings of the London Mathematical Society 103 (1), 106-138, 2011
27*2011
The provably total search problems of bounded arithmetic
A Skelley, N Thapen
Proceedings of the London Mathematical Society 103 (1), 106-138, 2011
232011
The provably total search problems of bounded arithmetic
A Skelley, N Thapen
preprint, 2007
142007
A third-order bounded arithmetic theory for PSPACE
A Skelley
International Workshop on Computer Science Logic, 340-354, 2004
102004
Theories and Proof Systems for PSPACE and the EXP-Time Hierarchy
AR Skelley
University of Toronto, 2006
92006
Relating the PSPACE reasoning power of Boolean programs and quantified Boolean formulas
A Skelley
Master’s thesis, University of Toronto, 2000. Available from ECCC in the …, 2000
92000
Relating the PSPACE reasoning power of Boolean programs and quantified Boolean formulas
A Skelley
Master’s thesis, University of Toronto, 2000. Available from ECCC in the …, 2000
92000
Propositional PSPACE reasoning with Boolean programs versus quantified Boolean formulas
A Skelley
International Colloquium on Automata, Languages, and Programming, 1163-1175, 2004
82004
Third-order computation and bounded arithmetic
A Skelley
Journal of Logic and Computation 17 (6), 1167-1191, 2007
22007
December 2, 2006
A Skelley
2006
Bounded Arithmetic vs. Propositional Proof Systems vs. Complexity Classes (depth oral survey)
A Skelley
2005
Subsystems of BPLK
A Skelley
2005
Revised Research Proposal or Preliminary Thesis Proposal
A Skelley
2005
Some open problems in bounded arithmetic and propositional proof complexity (research proposal paper)
A Skelley
2005
A Third-Order Bounded Arithmetic Theory for
A Skelley
2004
A resolution lower bound for a principle capturing the hardness of depth-1 LK
A Skelley, N Thapen
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–18