Author:
Arvind V.,Köbler J.,Mundhenk M.
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. E. Allender and L. Hemachandra. Lower bounds for the low hierarchy. Journal of the ACM, 39(1):234–250, 1992.
2. V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, #623:162–173, Springer Verlag, 1992.
3. E. Allender, L. Hemachandra, M. Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets. SIAM Journal on Computing, to appear.
4. V. Arvind, J. Köbler, and M. Mundhenk. On bounded truth-table, conjunctive, and randomized reductions to sparse sets. To appear in Proceedings 12th Conference on the Foundations of Software Technology & Theoretical Computer Science, 1992.
5. J. Balcázar and R. Book. Sets with small generalized Kolmogorov complexity. Acta Informatica, 23(6):679–688, 1986.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献