Author:
Arvind V.,Köbler J.,Mundhenk M.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. V. Arvind, Y. Han, L.A. 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 ICALP, Lecture Notes in Computer Science, #623:162–173, Springer Verlag, 1992.
2. V. Arvind, J. Köbler, and M. Mundhenk. On bounded truth-table, conjunctive, and randomized reductions to sparse sets. In Proceedings 12th Conference on the Foundations of Software Technology & Theoretical Computer Science, Lecture Notes in Computer Science, #652:140–151, Springer Verlag, 1992.
3. V. Arvind, J. Köbler, and M. Mundhenk. Lowness and the complexity of sparse and tally descriptions. In Proceedings Third International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, #650:249–258, Springer Verlag, 1992.
4. V. Arvind, J. Köbler, and M. Mundhenk. Reliable reductions, high sets and low sets. Technical Report, Universität Ulm, Ulmer Informatik-Bericht 92-19, 1992.
5. J. Balcazár. Self-reducibility. Journal of Computer and System Sciences, 41:367–388, 1990.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning Reductions to Sparse Sets;Mathematical Foundations of Computer Science 2013;2013
2. On self-reducible sets of low information content;Lecture Notes in Computer Science;1994