Some results on selectivity and self-reducibility
From MaRDI portal
Publication:672402
DOI10.1016/0020-0190(95)00073-LzbMATH Open0875.68423MaRDI QIDQ672402FDOQ672402
Authors: Jie Wang 
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
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
- Title not available (Why is that?)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- Polynomial-Time Membership Comparable Sets
- Semirecursive Sets and Positive Reducibility
- On self-reducibility and weak P-selectivity
- Computing Solutions Uniquely Collapses the Polynomial Hierarchy
- Strong nondeterministic polynomial-time reducibilities
- PP is closed under truth-table reductions
- Reductions on NP and p-selective sets
- Some observations on NP real numbers and P-selective sets
- Adaptive versus nonadaptive queries to NP and P-selective sets
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
Cited In (1)
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)
