Knuth prize lecture: on the difficulty of approximating Boolean max-CSPs

DOI10.1109/FOCS.2018.00063MaRDI QIDQ6944350zbMATH OpenFDO

Authors Johan Hastad

Publication date 12 August 2025

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

This page was built for publication: Knuth prize lecture: on the difficulty of approximating Boolean max-CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944350)