Randall Pruim

According to our database1, Randall Pruim authored at least 8 papers between 1994 and 2002.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2001
Hyper-polynomial hierarchies and the polynomial jump.
Theor. Comput. Sci., 2001

Relativized separation of EQP from PNP.
Inf. Process. Lett., 2001

2000
Review of Hilbert's Tenth Problem by Yttri Matiyasevich.
SIGACT News, 2000

1999
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy
Electronic Colloquium on Computational Complexity (ECCC), 1999

1998
Gems of theoretical computer science.
Springer, ISBN: 978-3-540-64425-5, 1998

1997
Hyper-Polynomial Hierarchies and the NP-Jump.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1994
Collapsing Degrees in Subexponential Time.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994


  Loading...