Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. S. Aida and T. Tsukiji, P-comp versus P-samp questions on average polynomial domination. IEICE Trans. Inf. & Syst., E84-D (2001), 1402–1410.
2. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson, BPP has subexponential time simulation unless EXPTIME has publishable proofs, Comput. Complexity, 3 (1993), 307–318.
3. Lect Notes Comput Sci;H. Buhrman,1999
4. H. Buhrman, L. Fortnow, and S. Laplante, Resource-bounded Kolmogorov complexity revisited, SIAM J. Comput., 31 (2002), 887–905.
5. H. Buhrman and L. Torenvliet, Randomness is hard, SIAM J. Comput., 30 (2000), 1485–1501.