No. |
Title |
Author |
Year |
---|

1 |
Nearly Optimal Embeddings of Flat Tori |
Agarwal, Ishan et al. |
2020 |

2 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121) |
Gál, Anna et al. |
2017 |

3 |
The Minrank of Random Graphs |
Golovnev, Alexander et al. |
2017 |

4 |
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree |
Barak, Boaz et al. |
2015 |

5 |
The List-Decoding Size of Fourier-Sparse Boolean Functions |
Haviv, Ishay et al. |
2015 |

6 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121) |
Gal, Anna et al. |
2014 |

7 |
The Unique Games Conjecture with Entangled Provers is False |
Kempe, Julia et al. |
2008 |