| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem | Austrin, Per et al. | 2023 |
| 2 | Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder | Austrin, Per et al. | 2019 |
| 3 | Tensor Network Complexity of Multilinear Maps | Austrin, Per et al. | 2018 |
| 4 | Dense Subset Sum May Be the Hardest | Austrin, Per et al. | 2016 |
| 5 | Subset Sum in the Absence of Concentration | Austrin, Per et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |