Reductions to sets of low information content-Reference-Cited by-同舟云学术

Reductions to sets of low information content

Published:1992 Issue: Volume: Page:162-173
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Arvind V.,Han Y.,Hemachandra L.,Köbler J.,Lozano A.,Mundhenk M.,Ogiwara M.,Schöning U.,Silvestri R.,Thierauf T.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55719-9_72

Reference44 articles.

1. A. Amir, R. Beigel, and W. Gasarch. Some connections between bounded query classes and non-uniform complexity. In Proceedings of the 5th Structure in Complexity Theory Conference, pages 232–243. IEEE Computer Society Press, July 1990.

2. E. Allender, L. Hemachandra, M. Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets. SIAM Journal on Computing. To appear. Preliminary version appears as [AHOW91].

3. E. Allender, L. Hemachandra, M. Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets. In Proceedings of the 6th Structure in Complexity Theory Conference, pages 220–229. IEEE Computer Society Press, June/July 1991.

4. V. Arvind, J. Köbler, and M. Mundhenk. Bounded truth-table and conjunctive reductions to sparse and tally sets. In preparation.

5. P. Berman. Relationship between density and deterministic complexity of NP-complete languages. In Proceedings of the 5th International Colloquium on Automata, Languages, and Programming, pages 63–71. Springer-Verlag Lecture Notes in Computer Science #62, 1978.

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

1. Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity;Complexity and Approximation;2020

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

3. Competing Provers Yield Improved Karp-Lipton Collapse Results;Lecture Notes in Computer Science;2003

4. There Are No Sparse NPw-Hard Sets;Mathematical Foundations of Computer Science 2001;2001

5. Towards the Actual Relationship Between NP and Exponential Time;Mathematical Logic Quarterly;1999