Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492902
DOI10.1007/11549345zbMath1156.68461MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
03B25: Decidability of theories and sets of sentences
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)