Automata, Languages and Programming
From MaRDI portal
Publication:5466493
DOI10.1007/b99859zbMath1099.68642MaRDI QIDQ5466493
Martin Grohe, Mark Weyer, Jörg Flum
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
68Q25: Analysis of algorithms and problem complexity
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
On miniaturized problems in parameterized complexity theory, On problems without polynomial kernels, On the computational hardness based on linear fpt-reductions