On bounded truth-table, conjunctive, and randomized reductions to sparse sets-Reference-Cited by-同舟云学术

On bounded truth-table, conjunctive, and randomized reductions to sparse sets

Published:1992 Issue: Volume: Page:140-151
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Arvind V.,Köbler J.,Mundhenk M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56287-7_101.pdf

Reference24 articles.

1. L. Adleman and K. Manders. Reducibility, randomness and intractability, In Proceedings of the 9th ACM Sympos. Theory of Computing 151–163.

2. E. Allender, L. Hemachandra, M. Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets. Proceeding 6th Structure in Complexity Theory Conference, 1991.

3. [AHH+92] 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 Proceedings of the 19th International Colloquium on Automata, Languages, and Programming. To appear.

4. V. Arvind, J. Köbler, and M. Mundhenk. Bounded truth-table and conjunctive reductions to sparse and tally sets. Ulmer Informatik Berichte 92–01, 1992.

5. J. Balcázar, R. Book, and U. Schöning. Sparse sets, lowness and highness. SIAM J. Comput., 15:739–745, 1986.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Reductions to Sparse Sets;Mathematical Foundations of Computer Science 2013;2013

2. On hard instances;Theoretical Computer Science;2000-07

3. NP-hard sets have many hard instances;Mathematical Foundations of Computer Science 1997;1997

4. Sparse Sets versus Complexity Classes;Complexity Theory Retrospective II;1997

5. Monotonous and randomized reductions to sparse sets;RAIRO - Theoretical Informatics and Applications;1996