Publication:2913810
From MaRDI portal
DOI10.4086/toc.2012.v008a010zbMath1247.68099MaRDI QIDQ2913810
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a010
03D15: Complexity of computation (including implicit computational complexity)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)