Fast Computation of the Arnold Complexity of Length 2n Binary Words
Abstract
For fast computation of the Arnold complexity of length 2n binary words we obtain an upper bound for the Shannon function Sh(n)
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.