Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492902
DOI10.1007/11549345zbMath1156.68461OpenAlexW2494705596MaRDI QIDQ5492902
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/11549345
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Computational completeness of equations over sets of natural numbers ⋮ Least and greatest solutions of equations over sets of integers ⋮ Language equations
This page was built for publication: Mathematical Foundations of Computer Science 2005