P-selectivity: Intersections and indices
Authors:
- Lane A. HemaspaandraLHLane A. Hemaspaandra
- Jiang ZhigenJZJiang Zhigen
Open Access
- 1 July 1995
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 145 (1-2) , 371-380
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Semi-membership algorithmsACM SIGACT News, 1994
- Twenty questions to a p-selectorInformation Processing Letters, 1993
- Separating complexity classes with tally oraclesTheoretical Computer Science, 1992
- Book Review: Recursively enumerable sets and degrees: A study of computable functions and computably generated setsBulletin of the American Mathematical Society, 1988
- Reductions on NP and P-selective setsTheoretical Computer Science, 1982
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPTheory of Computing Systems, 1979
- J. Hartmanis and F. D. Lewis. The use of lists in the study of undecidable problems in automata theory. Journal of computer and system sciences, vol. 5 (1971), pp. 54–66.The Journal of Symbolic Logic, 1974
- The use of lists in the study of undecidable problemsin automata theoryJournal of Computer and System Sciences, 1971
- Semirecursive Sets and Positive ReducibilityTransactions of the American Mathematical Society, 1968
- Semirecursive sets and positive reducibilityTransactions of the American Mathematical Society, 1968