The following pages link to Self-reducibility (Q2639637):
Displaying 15 items.
- Revisiting a result of Ko (Q286990) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Helping by unambiguous computation and probabilistic computation (Q675865) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- Quasi-linear truth-table reductions to \(p\)-selective sets (Q1351469) (← links)
- P-immune sets with holes lack self-reducibility properties. (Q1401340) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
- A note on bi-immunity and \(p\)-closeness of \(p\)-cheatable sets in \(P\)/poly (Q2366689) (← links)
- New collapse consequences of NP having small circuits (Q4645178) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- Upper bounds for the complexity of sparse and tally descriptions (Q4864446) (← links)
