On self-reducibility and weak P-selectivity
- 1 April 1983
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 26 (2) , 209-221
- https://doi.org/10.1016/0022-0000(83)90013-2
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A low and a high hierarchy within NPJournal of Computer and System Sciences, 1983
- The maximum value problem and NP real numbersJournal of Computer and System Sciences, 1982
- Some observations on NP real numbers and P-selective setsJournal of Computer and System Sciences, 1981
- Completeness, Approximation and DensitySIAM Journal on Computing, 1981
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPTheory of Computing Systems, 1979
- A Note on Sparse Complete SetsSIAM Journal on Computing, 1979
- Some lowness properties and computational complexity sequencesTheoretical Computer Science, 1978
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975