Pages that link to "Item:Q4016912"
From MaRDI portal
The following pages link to Relating Equivalence and Reducibility to Sparse Sets (Q4016912):
Displaying 9 items.
- Polynomial-time compression (Q1198955) (← links)
- The structure of logarithmic advice complexity classes (Q1275000) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- Bounded queries to arbitrary sets (Q4717045) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- On the power of generalized Mod-classes (Q4864444) (← 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)
