Author:
Cai Jin -yi,Selman Alan L.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. J. Balcázar and U. Schöning. Bi-immune sets for complexity classes. Mathematical Systems Theory, 18:1–10, 1985.
2. J. Belanger and J. Wang. Rankable distributions do not provide harder instances than uniform distributions. Manuscript, 1995.
3. S. Ben-Davíd, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. J. Computer System Sci., 44(2):193–219, 1992.
4. S. Cook and R. Reckow. Time bounded random access machines. J. Comput. System Sci., 7:354–375, 1973.
5. J. Geske, D. Huynh, and A. Selman. A hierarchy theorem for almost every-where complex sets with application to polynomial complexity degrees. In STACS 1987, 1987.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献