Fast computation of the Arnold complexity of length \(2^{n}\) binary words (Q376820)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast computation of the Arnold complexity of length 2ⁿ binary words |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast computation of the Arnold complexity of length \(2^{n}\) binary words |
scientific article |
Statements
Fast computation of the Arnold complexity of length \(2^{n}\) binary words (English)
0 references
19 November 2013
0 references
binary word
0 references
word complexity
0 references
Arnold complexity
0 references
