Theories of computational complexity

From MaRDI portal
Revision as of 07:27, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1210716


zbMath0633.03034MaRDI QIDQ1210716

Cristian S. Calude

Publication date: 5 June 1993

Published in: Annals of Discrete Mathematics (Search for Journal in Brave)


68Q25: Analysis of algorithms and problem complexity

03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations

03D15: Complexity of computation (including implicit computational complexity)

68-02: Research exposition (monographs, survey articles) pertaining to computer science

03D20: Recursive functions and relations, subrecursive hierarchies

03D60: Computability and recursion theory on ordinals, admissible sets, etc.


Related Items