Characterizing \(\text{TC}^{0}\) in terms of infinite groups
From MaRDI portal
Publication:2643132
DOI10.1007/s00224-006-1310-2zbMath1121.68075MaRDI QIDQ2643132
Andreas Krebs, Klaus-Joern Lange, Stephanie Reifferscheid
Publication date: 23 August 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-006-1310-2
68Q70: Algebraic theory of languages and automata
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Linear circuits, two-variable logic and weakly blocked monoids, Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages