Author:
Karpinski Marek,Verbeek Rutger
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Adleman, L., Two Theorems on Random Polynomial Time, Proc. 19th IEEE FOCS, 1972, pp. 75–83.
2. Adleman, L., Manders, K., Reducibility, Randomness, and Intractibility, Proc. 9th ACM STOC, 1977, pp. 151–163.
3. Allender, E., Beigel, R., Hertrampf, U., Homer, S., Almost-Everywhere Complexity Hierarchies for Nondeterministic Time, Manuscript, 1992; A preliminary version has appeared in Proc. STACS '90, LNCS 415, Springer-Verlag, 1990, pp. 1–11.
4. Bennett, Ch. H., Gill, J., Relative to a Random Oracle A, P A ≠ N P A ≠ co-N P A with Probability 1, SIAM J. on Computing 10, 1981, pp. 96–113.
5. Fortnow, L., Personal Communication, 1992.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献