scientific article; zbMATH DE number 54110
From MaRDI portal
Publication:4004292
Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- scientific article; zbMATH DE number 1371320
- scientific article; zbMATH DE number 2229972
- Algorithmic concepts of informatics. Computability, complexity theory, algorithmics, cryptography. An introduction
- scientific article; zbMATH DE number 193197
- scientific article; zbMATH DE number 1047152
- Problems on Algorithms
- scientific article; zbMATH DE number 579118
- Introduction to algorithm theory
Cited in
(7)- Computability. Recursive and programmable functions
- Algorithmic concepts of informatics. Computability, complexity theory, algorithmics, cryptography. An introduction
- scientific article; zbMATH DE number 192944 (Why is no real title available?)
- scientific article; zbMATH DE number 2041016 (Why is no real title available?)
- scientific article; zbMATH DE number 1560883 (Why is no real title available?)
- Problems on Algorithms
- Computability. Models of computation and undecidability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4004292)
