Fast Computation of the Arnold Complexity of Length $2^{n}$ Binary Words
  For fast computation of the Arnold complexity of length $2^{n}$ binary words we obtain an upper bound for the Shannon function $Sh(n)$ 
Yuri V. Merekin
math.CO cs.IT math.IT