Recommendations
Cites work
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- Logarithmic advice classes
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets
- On self-reducibility and weak P-selectivity
- Optimal advice
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- Reducibility classes of P-selective sets
- Relativized circuit complexity
- Semirecursive Sets and Positive Reducibility
Cited in
(11)- scientific article; zbMATH DE number 1543037 (Why is no real title available?)
- Separating NE from Some Nonuniform Nondeterministic Complexity Classes
- Quasi-linear truth-table reductions to \(p\)-selective sets
- Query complexity of membership comparable sets.
- \(p\)-selective self-reducible sets: a new characterization of P
- scientific article; zbMATH DE number 4130363 (Why is no real title available?)
- With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets
- Separating NE from some nonuniform nondeterministic complexity classes
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets
- Reducibility classes of P-selective sets
- Optimal advice
This page was built for publication: On sets Turing reducible to p-selective sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675861)
