Fundamentals of Computation Theory
From MaRDI portal
Publication:5492918
DOI10.1007/11537311zbMath1123.68051OpenAlexW2491671784MaRDI QIDQ5492918
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Analysis of algorithms and problem complexity (68Q25) Recurrences (11B37) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication: Fundamentals of Computation Theory