CRN Elimination and Substitution Bases for Complexity Classes

DOI10.3233/FI-2012-748zbMath1260.03076OpenAlexW2151430929MaRDI QIDQ3168519

Stefano Mazzanti

Publication date: 31 October 2012

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2012-748

zbMATH Keywords

complexity classessubstitution basisconcatenation recursion on notation

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

On the coincidence of complexity classes BPC and \(\text{TC}^0 \) ⋮ New substitution bases for complexity classes ⋮ Arithmetization of register machines with counters ⋮ Bounded monotone recursion and multihead automata ⋮ Complexity of the search for the least solution to a system of dictionary equations of exponential type

This page was built for publication: CRN Elimination and Substitution Bases for Complexity Classes