Publication:5093396
From MaRDI portal
DOI10.4086/toc.2022.v018a010MaRDI 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
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Qxx: Theory of computing
Cites Work