The following pages link to (Q4281491):
Displaying 19 items.
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Dimension, halfspaces, and the density of hard sets (Q649114) (← links)
- The structure of logarithmic advice complexity classes (Q1275000) (← links)
- On reductions of NP sets to sparse sets (Q1329162) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- On sparseness, reducibilities, and complexity (Q1779309) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
- Towards the Actual Relationship Between NP and Exponential Time (Q4238424) (← links)
- Fault-tolerance and complexity (Extended abstract) (Q4630260) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- Upper bounds for the complexity of sparse and tally descriptions (Q4864446) (← links)
- On sparseness and Turing reducibility over the reals (Q4916198) (← links)
- Information Lower Bounds via Self-reducibility (Q4928483) (← links)
- On Degree of Pareto Set Reduction Using Information Quanta (Q5054514) (← links)
