Faster Algorithms and Constant Lower Bounds for the Worst-Case Expected Error

von Brown-Cohen, Jonah
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 33 of 36 (2022)

Optimal Inapproximability with Universal Factor Graphs

von Austrin, Per
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 1 of 4 (2021)