Author:
Cai Jin-Yi,Ogihara Mitsunori
Reference58 articles.
1. M. Agrawal and V. Arvind. Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets. In Proceedings of the 10th Annual IEEE Conference on Structure in Complexity Theory, pages 264–276, 1995.
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. In K. Ambos-Spies, S. Homer, and U. Schöning, editors, Complexity Theory, pages 1–46, Cambridge: Cambridge University Press, 1993.
3. V. Arvind, J. Köbler, and M. Mundhenk. Lowness and the complexity of sparse and tally descriptions. In Proceedings of the 3rd International Symposium on Algorithms and Computation, pages 249–258. Lecture Notes in Computer Science 650, Berlin: Springer-Verlag, 1992.
4. V. Arvind, J. Köbler, and M. Mundhenk. On bounded truth-table, conjunctive, and randomized reductions to sparse sets. In Proceedings of the 12th Annual Symposium on Foundations of Software Technology and Theoretical Computer Science, pages 140–151. Lecture Notes in Computer Science 652, Berlin: Springer-Verlag, 1992.
5. M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in c log n parallel steps. Com-binatorica, 3(1):1–19, 1983.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bibliography;Theory of Computational Complexity;2013-12-06
2. On Small Hard Leaf Languages;Mathematical Foundations of Computer Science 2005;2005
3. Sparse NP-complete problems over the reals with addition;Theoretical Computer Science;2001-03
4. Sparse Sets, Approximable Sets, and Parallel Queries to NP;STACS 99;1999