Minimization and \(\mathbf{NP}\) multifunctions

DOI10.1016/j.tcs.2003.10.020zbMath1081.03041OpenAlexW2002433529MaRDI QIDQ1827394

Norman Danner, Chris Pollett

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

zbMATH Keywords

MinimizationImplicit computational complexityNon-deterministic partial multifunctionsSafe recursion

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• A new recursion-theoretic characterization of the polytime functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimization and \(\mathbf{NP}\) multifunctions