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

1 | A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs | Manurangsi, Pasin et al. | 2017 |

2 | On the Bit Complexity of Sum-of-Squares Proofs | Raghavendra, Prasad et al. | 2017 |

3 | Correlation Decay and Tractability of CSPs | Brown-Cohen, Jonah et al. | 2016 |

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

5 | Gap Amplification for Small-Set Expansion via Random Walks | Raghavendra, Prasad et al. | 2014 |

Number of result pages: | 1 |

Number of documents: | 5 |