Beyond PNP=NEXP
From MaRDI portal
Publication:4596658
DOI10.1007/3-540-59042-0_110zbMath1379.68140OpenAlexW54566029MaRDI QIDQ4596658
Stephen A. Fenner, Lance J. Fortnow
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_110
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication: Beyond PNP=NEXP