scientific article; zbMATH DE number 7528581

DOI10.4086/toc.2022.v018a005OpenAlexW4226342274MaRDI QIDQ5077147

Subhash A. Khot, Amey Bhangale

Publication date: 18 May 2022

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2022.v018a005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-hardnessinapproximabilityunique games conjecture

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of computing (68Qxx)

This page was built for publication: