Resource-bounded instance complexity

DOI10.1007/3-540-59042-0_108zbMath1379.68141OpenAlexW2275947341MaRDI QIDQ4596656

Lance J. Fortnow, Martin Kummer

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_108

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Resource-bounded instance complexity