Minimization and \(\mathbf{NP}\) multifunctions
From MaRDI portal
Publication:1827394
DOI10.1016/j.tcs.2003.10.020zbMath1081.03041MaRDI QIDQ1827394
Publication date: 6 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.020
Minimization; Implicit computational complexity; Non-deterministic partial multifunctions; Safe recursion
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03D20: Recursive functions and relations, subrecursive hierarchies
Cites Work