Knuth Prize Lecture: On the Difficulty of Approximating Boolean Max-CSPs

Johan HÃ¥stad. Knuth Prize Lecture: On the Difficulty of Approximating Boolean Max-CSPs. In Mikkel Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018. pages 602, IEEE Computer Society, 2018. [doi]

Abstract

Abstract is missing.