P-selectivity: Intersections and indices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
- BANISHING ROBUST TURING COMPLETENESS
- Complexity classes without machines: on complete languages for UP
- Computing Solutions Uniquely Collapses the Polynomial Hierarchy
- Defying upward and downward separation
- On Circuit-Size Complexity and the Low Hierarchy in NP
- On self-reducibility and weak P-selectivity
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- Polynomial-Time Membership Comparable Sets
- Reductions on NP and p-selective sets
- Semirecursive Sets and Positive Reducibility
- Separating complexity classes with tally oracles
- The use of lists in the study of undecidable problems in automata theory
Cited in
(12)- scientific article; zbMATH DE number 1796952 (Why is no real title available?)
- SOFSEM 2006: Theory and Practice of Computer Science
- Query-monotonic Turing reductions
- Boolean operations, joins, and the extended low hierarchy
- scientific article; zbMATH DE number 1543295 (Why is no real title available?)
- Closure and nonclosure properties of the classes of compressible and rankable sets
- Reducibility classes of P-selective sets
- Optimal advice
- scientific article; zbMATH DE number 1543037 (Why is no real title available?)
- The complexity of finding top-Toda-equivalence-class members
- NP-hard sets are superterse unless NP is small
- LATIN 2004: Theoretical Informatics
This page was built for publication: P-selectivity: Intersections and indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673115)
