Publications of Randall Pruim

Uwe Schöning, Randall Pruim. Gems of Theoretical Computer Science, Springer, 1998. (preface and contents available in html and pdf formats)

S. Fenner, S. Homer, F. Green, R. Pruim. Determining Acceptance Possibility for Quantum Computation is Hard for the Polynomial Heierachy Journal submission. Appeared earlier in Proceedings of the Sixth Italian Conference on Theoretical Computer Science, November 1998. Other versions also appeared as ECCC technical report ECCC TR99-003, and LANL preprint quant-ph/9812056.
S. Fenner, S. Homer, M. Schaefer, R. Pruim. Hyper-Polynomial Hierarchies and the NP-Jump. Journal submission version. Also appeared in Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 1997, pages 102-110.

Page Created: Fri Feb 12 14:14:20 1999
Last Modified: Thu Jul 29 19:57:54 1999
Maintained by: Randall Pruim