"superpolylogarithmic" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "polylogarithmic"
      },
      "expansion": "super- + polylogarithmic",
      "name": "pre"
    }
  ],
  "etymology_text": "From super- + polylogarithmic.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "superpolylogarithmic (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with super-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2003, Jiri Wiedermann, Peter van Emde Boas, Mogens Nielsen, Automata, Languages and Programming: 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings (page 152)",
          "text": "The polylogarithmic bound on g is necessary. To see this, let f(x) = Σxᵢ, and let g(x) be |x|/2 (or any other superpolylogarithmic threshold)."
        },
        {
          "ref": "2016, Thang N. Dinh, My T. Thai, Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings (page 169)",
          "text": "Lindzey noticed that it is possible to speed-up several graph algorithms using switching to a lower number of edges - he obtained up to superpolylogarithmic speed-ups of algorithms for diameter, transitive closure, bipartite maximum matching and general maximum matching."
        }
      ],
      "glosses": [
        "growing faster than any polynomial but slower than any exponential function."
      ],
      "id": "en-superpolylogarithmic-en-adj-44AxMI13",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "growing",
          "grow"
        ],
        [
          "faster",
          "faster"
        ],
        [
          "polynomial",
          "polynomial"
        ],
        [
          "slower",
          "slower"
        ],
        [
          "exponential",
          "exponential"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(mathematics) growing faster than any polynomial but slower than any exponential function."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "superpolylogarithmic"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "polylogarithmic"
      },
      "expansion": "super- + polylogarithmic",
      "name": "pre"
    }
  ],
  "etymology_text": "From super- + polylogarithmic.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "superpolylogarithmic (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms prefixed with super-",
        "English uncomparable adjectives",
        "Pages with 1 entry",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2003, Jiri Wiedermann, Peter van Emde Boas, Mogens Nielsen, Automata, Languages and Programming: 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings (page 152)",
          "text": "The polylogarithmic bound on g is necessary. To see this, let f(x) = Σxᵢ, and let g(x) be |x|/2 (or any other superpolylogarithmic threshold)."
        },
        {
          "ref": "2016, Thang N. Dinh, My T. Thai, Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings (page 169)",
          "text": "Lindzey noticed that it is possible to speed-up several graph algorithms using switching to a lower number of edges - he obtained up to superpolylogarithmic speed-ups of algorithms for diameter, transitive closure, bipartite maximum matching and general maximum matching."
        }
      ],
      "glosses": [
        "growing faster than any polynomial but slower than any exponential function."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "growing",
          "grow"
        ],
        [
          "faster",
          "faster"
        ],
        [
          "polynomial",
          "polynomial"
        ],
        [
          "slower",
          "slower"
        ],
        [
          "exponential",
          "exponential"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(mathematics) growing faster than any polynomial but slower than any exponential function."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "superpolylogarithmic"
}