Some results on complexity of μ-calculus evaluation in the black-box model

DOI10.1051/ita/2012030zbMath1269.68056OpenAlexW2000575661MaRDI QIDQ2842242

Paweł Parys

Publication date: 13 August 2013

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2012030

zbMATH Keywords

\(\mu\)-calculuslower boundexpression complexityblack-box model

Mathematics Subject Classification ID

Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Some results on complexity of μ-calculus evaluation in the black-box model