Per Austrin, Jonah Brown-Cohen, Johan Håstad. Optimal Inapproximability with Universal Factor Graphs. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 434-453, SIAM, 2022. [doi]
@inproceedings{AustrinBH22,
title = {Optimal Inapproximability with Universal Factor Graphs},
author = {Per Austrin and Jonah Brown-Cohen and Johan Håstad},
year = {2022},
doi = {10.1137/1.9781611976465.27},
url = {https://doi.org/10.1137/1.9781611976465.27},
researchr = {https://researchr.org/publication/AustrinBH22},
cites = {0},
citedby = {0},
pages = {434-453},
booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
editor = {Joseph (Seffi) Naor and Niv Buchbinder},
publisher = {SIAM},
isbn = {978-1-61197-707-3},
}