scientific article; zbMATH DE number 7528581
From MaRDI portal
Publication:5077147
DOI10.4086/TOC.2022.V018A005OpenAlexW4226342274MaRDI QIDQ5077147FDOQ5077147
Authors: Amey Bhangale, Subhash Khot 
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 of this publication is not available (Why is that?)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of computing (68Qxx)
Cited In (1)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077147)
