Author:
Hemaspaandra Lane A.,Rothe Jörg,Wechsung Gerd
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. L. Adleman. Time, space, and randomness. Technical Report MIT/LCS/TM-131, MIT, Cambridge, MA, April 1979.
2. E. Allender. The complexity of sparse sets in P. In Proceedings of the 1st Structure in Complexity Theory Conference, pages 1–11. Springer-Verlag Lecture Notes in Computer Science 223, June 1986.
3. E. Allender. Applications of time-bounded Kolmogorov complexity in complexity theory. In O. Watanabe, editor, Kolmogorov Complexity and Computational Complexity, EATCS Monographs on Theoretical Computer Science, pages 4–22. Springer-Verlag, 1992.
4. E. Allender and R. Rubinstein. P-printable sets. SIAM Journal on Computing, 17(6): 1193–1202, 1988.
5. A. Borodin and A. Demers. Some comments on functional self-reducibility and the NP hierarchy. Technical Report TR 76-284, Cornell Department of Computer Science, Ithaca, NY, July 1976.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献