Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68062OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716845

Dieter van Melkebeek, Scott Diehl

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

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: Automata, Languages and Programming