Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of computing (68Q01)
Recommendations
Cited in
(15)- Theory of computation
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 54290 (Why is no real title available?)
- scientific article; zbMATH DE number 107969 (Why is no real title available?)
- Mathematics in Computing
- Languages, machines, and classical computation
- scientific article; zbMATH DE number 3965406 (Why is no real title available?)
- Can a free market be complete?
- Concise guide to computation theory.
- Computability and complexity theory.
- The pillars of computation theory. State, encoding, nondeterminism
- scientific article; zbMATH DE number 5778850 (Why is no real title available?)
- The nature of computation
- What can be computed? A practical guide to the theory of computation
- Formal languages and computation. Models and their applications
This page was built for publication: Elements of computation theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010960)
