"kernelizability" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "kernelizability (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2016, Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier, “A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems”, in arXiv",
          "text": "In this way, we obtain fixed-parameter tractability and polynomial kernelizability results, with the central parameter being the maximum vertex degree.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "The condition of being kernelizable"
      ],
      "id": "en-kernelizability-en-noun-1N0R-vhg",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "kernelizable",
          "kernelizable"
        ]
      ],
      "raw_glosses": [
        "(mathematics) The condition of being kernelizable"
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "kernelizability"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "kernelizability (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with quotations",
        "English uncountable nouns",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2016, Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier, “A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems”, in arXiv",
          "text": "In this way, we obtain fixed-parameter tractability and polynomial kernelizability results, with the central parameter being the maximum vertex degree.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "The condition of being kernelizable"
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "kernelizable",
          "kernelizable"
        ]
      ],
      "raw_glosses": [
        "(mathematics) The condition of being kernelizable"
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "kernelizability"
}