2002 |
6 | EE | Chris Pollett,
Randall Pruim:
Strengths and Weaknesses of LH Arithmetic.
Math. Log. Q. 48(2): 221-243 (2002) |
2001 |
5 | EE | Frederic Green,
Randall Pruim:
Relativized separation of EQP from PNP.
Inf. Process. Lett. 80(5): 257-260 (2001) |
4 | EE | Stephen A. Fenner,
Steven Homer,
Randall Pruim,
Marcus Schaefer:
Hyper-polynomial hierarchies and the polynomial jump.
Theor. Comput. Sci. 262(1): 241-256 (2001) |
1999 |
3 | EE | Stephen A. Fenner,
Frederic Green,
Steven Homer,
Randall Pruim:
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy
Electronic Colloquium on Computational Complexity (ECCC) 6(3): (1999) |
1997 |
2 | EE | Stephen A. Fenner,
Steven Homer,
Randall Pruim,
Marcus Schaefer:
Hyper-Polynomial Hierarchies and the NP-Jump.
IEEE Conference on Computational Complexity 1997: 102-110 |
1994 |
1 | | Deborah Joseph,
Randall Pruim,
Paul Young:
Collapsing Degrees in Subexponential Time.
Structure in Complexity Theory Conference 1994: 367-382 |