Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits

DOI10.3103/S0027132216020029zbMath1342.68261MaRDI QIDQ2628763

D. V. Kochergin, Vadim V. Kochergin

Publication date: 15 July 2016

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION

Cites Work

• Optimal word chains for the Thue-Morse word
• Berechnungen in partiellen Algebren endlichen Typs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits