Elements of computation theory
From MaRDI portal
Publication:1010960
DOI10.1007/978-1-84882-497-3zbMath1182.68087OpenAlexW1626360986MaRDI QIDQ1010960
Publication date: 7 April 2009
Published in: Texts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-84882-497-3
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of computing (68Q01)
Related Items