Randall Pruim

According to our database, Randall Pruim authored at least 9 papers between 1994 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2017

The mosaic Package: Helping Students to Think with Data Using R.

Randall Pruim, Daniel T. Kaplan, Nicholas J. Horton

R J., 2017

2002

Strengths and Weaknesses of LH Arithmetic.

Chris Pollett, Randall Pruim

Math. Log. Q., 2002

2001

Hyper-polynomial hierarchies and the polynomial jump.

Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer

Theor. Comput. Sci., 2001

Relativized separation of EQP from P^NP.

Frederic Green, Randall Pruim

Inf. Process. Lett., 2001

2000

Review of Hilbert's Tenth Problem by Yttri Matiyasevich.

Randall Pruim

SIGACT News, 2000

1999

Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy

Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim

Electron. Colloquium Comput. Complex., 1999

1998

Gems of theoretical computer science.

Uwe Schöning, Randall Pruim

Springer, ISBN: 978-3-540-64425-5, 1998

1997

Hyper-Polynomial Hierarchies and the NP-Jump.

Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1994

Collapsing Degrees in Subexponential Time.

Deborah Joseph, Randall Pruim, Paul Young

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994