scientific article; zbMATH DE number 6871256
zbMath1393.68003MaRDI QIDQ4642339
Publication date: 22 May 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityTuring machinesreductionsfinite automatacomputability theorycomputational problemsintractable problemstractable problemsPython programsuncomputable problems
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)
Uses Software
This page was built for publication: