Arithmetic complexity, Kleene closure, and formal power series

DOI10.1007/s00224-003-1077-7zbMath1040.68043DBLPjournals/mst/AllenderAM03OpenAlexW1992166000WikidataQ61687397 ScholiaQ61687397MaRDI QIDQ1405781

V. Arvind, Meena Mahajan, Eric W. Allender

Publication date: 26 August 2003

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-003-1077-7

zbMATH Keywords

small arithmetic complexity classes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Comments on ``Arithmetic complexity, Kleene closure, and formal power series ⋮ Rigidity of a simple extended lower triangular matrix ⋮ On the complexity of matrix rank and rigidity ⋮ Cost Register Automata for Nested Words

This page was built for publication: Arithmetic complexity, Kleene closure, and formal power series