scientific article; zbMATH DE number 7456192
zbMath1480.00030MaRDI QIDQ5021292
Publication date: 12 January 2022
Full work available at URL: https://www.lms.ac.uk/sites/lms.ac.uk/files/files/NLMS_490_for%20web2_1.pdf#reftaskno.18
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Theory of programming languages (68N15) 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) External book reviews (00A17) Classical models of computation (Turing machines, etc.) (68Q04)
This page was built for publication:
