Skip to main content
Conference Proceedings

On sets bounded truth-table reducible to P-selective sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 775 LNCS 427-438
DOI: 10.1007/3-540-57785-8_160
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that if every NP set is (Formula Presented) reducible to some P-selective set, then NP is contained in DTIME(Formula Presented). The result is extended for some unbounded reducibilities such as (Formula Presented)-reducibility.

Cite

CITATION STYLE

APA

Thierauf, T., Toda, S., & Watanabe, O. (1994). On sets bounded truth-table reducible to P-selective sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 427–438). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_160

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free