Some results on selectivity and self-reducibility
From MaRDI portal
Publication:672402
Recommendations
- The Power of Self-Reducibility: Selectivity, Information, and Approximation
- \(p\)-selective self-reducible sets: a new characterization of P
- \(p\)-Selective sets and reducing search to decision vs. self-reducibility
- scientific article; zbMATH DE number 4022646
- Self-reducibility
- Some results on reducibility and strong reducibility.
- scientific article; zbMATH DE number 2165788
- Intrinsic Reducibilities
- scientific article; zbMATH DE number 15484
- Reduction principles in the theory of selections
Cites work
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- Adaptive versus nonadaptive queries to NP and P-selective sets
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
- Computing Solutions Uniquely Collapses the Polynomial Hierarchy
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets
- On self-reducibility and weak P-selectivity
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- PP is closed under truth-table reductions
- Polynomial-Time Membership Comparable Sets
- Reductions on NP and p-selective sets
- Semirecursive Sets and Positive Reducibility
- Some observations on NP real numbers and P-selective sets
- Strong nondeterministic polynomial-time reducibilities
This page was built for publication: Some results on selectivity and self-reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672402)
