The following pages link to Young Kun-Ko (Q4562274):
Displaying 6 items.
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- ETH Hardness for Densest-<i>k</i>-Subgraph with Perfect Completeness (Q4575829) (← links)
- Information value of two-prover games (Q4993275) (← links)
- Semi-Direct Sum Theorem and Nearest Neighbor under ℓ∞ (Q5009498) (← links)
- Approximating the best Nash Equilibrium in <i>n<sup>o</sup></i><sup>(log <i>n</i>)</sup>-time breaks the Exponential Time Hypothesis (Q5363042) (← links)
- Linear Programming Hierarchies Suffice for Directed Steiner Tree (Q5419003) (← links)
