Pages that link to "Item:Q1823690"
From MaRDI portal
The following pages link to Distinguishing conjunctive and disjunctive reducibilities by sparse sets (Q1823690):
Displaying 9 items.
- On adaptive versus nonadaptive bounded query machines (Q808242) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Reducibilities on tally and sparse sets (Q3357534) (← links)
- On the cutting edge of relativization: The resource bounded injury method (Q4632432) (← 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)
