Ordinal Hierarchies and Naming Complexity Classes

From MaRDI portal

Revision as of 07:30, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4107929

Jump to:navigation, search

DOI10.1145/321784.321793zbMath0339.68038OpenAlexW2082191047MaRDI QIDQ4107929

No author found.

Publication date: 1973

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321784.321793

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20) Hierarchies of computability and definability (03D55)

Related Items (3)

The intrinsic difficulty of recursive functions ⋮ The non-renamability of honesty classes ⋮ Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems

This page was built for publication: Ordinal Hierarchies and Naming Complexity Classes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4107929&oldid=17880016"