ON THE COMPUTATIONAL COMPLEXITY OF THE ARNOLD COMPLEXITY OF BINARY WORDS

DOI10.1142/S1793557109000546zbMath1184.68376OpenAlexW2090561381MaRDI QIDQ5189966

Yuri Vladimirovich Merekin

Publication date: 11 March 2010

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557109000546

zbMATH Keywords

computational complexitybinary wordcomplexity of words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Complexity of sequences and dynamical systems
• On addition chains

This page was built for publication: ON THE COMPUTATIONAL COMPLEXITY OF THE ARNOLD COMPLEXITY OF BINARY WORDS