Optimal Inapproximability with Universal Factor Graphs

Per Austrin, Jonah Brown-Cohen, Johan Håstad. Optimal Inapproximability with Universal Factor Graphs. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 434-453, SIAM, 2021. [doi]

Abstract

Abstract is missing.