The following pages link to (Q4256649):
Displaying 16 items.
- On random reductions from sparse sets to tally sets (Q685530) (← links)
- Some consequences of non-uniform conditions on uniform classes (Q794427) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets (Q1276171) (← links)
- On reductions of NP sets to sparse sets (Q1329162) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- On hard instances (Q1575555) (← links)
- Distinguishing conjunctive and disjunctive reducibilities by sparse sets (Q1823690) (← links)
- On Sparse Complete Sets (Q3346297) (← links)
- Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Q3978778) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- Upper bounds for the complexity of sparse and tally descriptions (Q4864446) (← links)
- On monotonous oracle machines (Q5096350) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
