"Karatsuba algorithm" meaning in English

{
  "etymology_text": "Discovered by Anatolii Alexeevitch Karatsuba in 1960 and published in 1962.",
  "forms": [
    {
      "form": "Karatsuba algorithms",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Karatsuba algorithm (plural Karatsuba algorithms)",
      "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": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A fast multiplication algorithm that reduces the multiplication of two n-digit numbers to at most n^(log ₂₃)≈n^(1.585) single-digit multiplications."
      ],
      "id": "en-Karatsuba_algorithm-en-noun-3AHV~4o1",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "multiplication",
          "multiplication"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "digit",
          "digit"
        ],
        [
          "number",
          "number"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A fast multiplication algorithm that reduces the multiplication of two n-digit numbers to at most n^(log ₂₃)≈n^(1.585) single-digit multiplications."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Karatsuba algorithm"
      ]
    }
  ],
  "word": "Karatsuba algorithm"
}

{
  "etymology_text": "Discovered by Anatolii Alexeevitch Karatsuba in 1960 and published in 1962.",
  "forms": [
    {
      "form": "Karatsuba algorithms",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Karatsuba algorithm (plural Karatsuba algorithms)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "Pages with 1 entry",
        "en:Theory of computing"
      ],
      "glosses": [
        "A fast multiplication algorithm that reduces the multiplication of two n-digit numbers to at most n^(log ₂₃)≈n^(1.585) single-digit multiplications."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "multiplication",
          "multiplication"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "digit",
          "digit"
        ],
        [
          "number",
          "number"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A fast multiplication algorithm that reduces the multiplication of two n-digit numbers to at most n^(log ₂₃)≈n^(1.585) single-digit multiplications."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Karatsuba algorithm"
      ]
    }
  ],
  "word": "Karatsuba algorithm"
}