scientific article; zbMATH DE number 7563812
From MaRDI portal
DOI10.4086/toc.2022.v018a010OpenAlexW4285124435MaRDI QIDQ5093396
Publication date: 26 July 2022
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2022.v018a010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of computing (68Qxx)
Cites Work