The following pages link to Optimal advice (Q672755):
Displaying 4 items.
- On sets Turing reducible to p-selective sets (Q675861) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES (Q5704373) (← links)
