{
  "id": "1209.4700",
  "version": "v1",
  "published": "2012-09-21T04:36:53.000Z",
  "updated": "2012-09-21T04:36:53.000Z",
  "title": "Fast Computation of the Arnold Complexity of Length $2^{n}$ Binary Words",
  "authors": [
    "Yuri V. Merekin"
  ],
  "comment": "7 pages",
  "categories": [
    "math.CO",
    "cs.IT",
    "math.IT"
  ],
  "abstract": "For fast computation of the Arnold complexity of length $2^{n}$ binary words we obtain an upper bound for the Shannon function $Sh(n)$",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-09-21T04:36:53.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68R15"
    ],
    "keywords": [
      "binary words",
      "arnold complexity",
      "fast computation",
      "upper bound"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1209.4700M"
    }
  }
}