Pages that link to "Item:Q3816983"
From MaRDI portal
The following pages link to On Sets Truth-Table Reducible to Sparse Sets (Q3816983):
Displaying 23 items.
- On adaptive versus nonadaptive bounded query machines (Q808242) (← links)
- Kolmogorov complexity and degrees of tally sets (Q916650) (← links)
- Bi-immunity results for cheatable sets (Q920981) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- The structure of logarithmic advice complexity classes (Q1275000) (← links)
- On symmetric differences of NP-hard sets with weakly P-selective sets (Q1314375) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Distinguishing conjunctive and disjunctive reducibilities by sparse sets (Q1823690) (← links)
- Polynomial-time reducibilities and ``almost all'' oracle sets (Q2639849) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Reducibilities on tally and sparse sets (Q3357534) (← links)
- Schnorr trivial sets and truth-table reducibility (Q3570160) (← links)
- On lower bounds of the closeness between complexity classes (Q4032931) (← links)
- (Q4256649) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- A refinement of the low and high hierarchies (Q4841766) (← links)
- On the power of generalized Mod-classes (Q4864444) (← links)
- Degrees and reducibilities of easy tally sets (Q5096899) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
- Weak mitoticity of bounded disjunctive and conjunctive truth-table autoreducible sets (Q5918833) (← links)
