"time complexity" meaning in English

See time complexity in All languages combined, or Wiktionary

Noun

Forms: time complexities [plural]
Head templates: {{en-noun|-|+}} time complexity (usually uncountable, plural time complexities)
  1. (computer science) The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms. Tags: uncountable, usually Categories (topical): Computer science Related terms: big O notation Translations (amount of time): Zeitkomplexität [feminine] (German), 時間計算量 (jikankeisanryō) (alt: じかんけいさんりょう) (Japanese), złożoność czasowa [feminine] (Polish)
    Sense id: en-time_complexity-en-noun-84TlI7j2 Categories (other): English entries with incorrect language header Topics: computer, computing, engineering, mathematics, natural-sciences, physical-sciences, science, sciences

Inflected forms

Download JSON data for time complexity meaning in English (2.0kB)

{
  "forms": [
    {
      "form": "time complexities",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "-",
        "2": "+"
      },
      "expansion": "time complexity (usually uncountable, plural time complexities)",
      "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": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms."
      ],
      "id": "en-time_complexity-en-noun-84TlI7j2",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "amount",
          "amount"
        ],
        [
          "time",
          "time"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "require",
          "require"
        ],
        [
          "run",
          "run"
        ],
        [
          "function",
          "function"
        ],
        [
          "input",
          "input"
        ],
        [
          "measured",
          "measured"
        ],
        [
          "ignore",
          "ignore"
        ],
        [
          "constant",
          "constant"
        ],
        [
          "term",
          "term"
        ],
        [
          "multiplication",
          "multiplication"
        ]
      ],
      "raw_glosses": [
        "(computer science) The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms."
      ],
      "related": [
        {
          "word": "big O notation"
        }
      ],
      "tags": [
        "uncountable",
        "usually"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "translations": [
        {
          "code": "de",
          "lang": "German",
          "sense": "amount of time",
          "tags": [
            "feminine"
          ],
          "word": "Zeitkomplexität"
        },
        {
          "alt": "じかんけいさんりょう",
          "code": "ja",
          "lang": "Japanese",
          "roman": "jikankeisanryō",
          "sense": "amount of time",
          "word": "時間計算量"
        },
        {
          "code": "pl",
          "lang": "Polish",
          "sense": "amount of time",
          "tags": [
            "feminine"
          ],
          "word": "złożoność czasowa"
        }
      ]
    }
  ],
  "word": "time complexity"
}
{
  "forms": [
    {
      "form": "time complexities",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "-",
        "2": "+"
      },
      "expansion": "time complexity (usually uncountable, plural time complexities)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "big O notation"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "en:Computer science"
      ],
      "glosses": [
        "The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "amount",
          "amount"
        ],
        [
          "time",
          "time"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "require",
          "require"
        ],
        [
          "run",
          "run"
        ],
        [
          "function",
          "function"
        ],
        [
          "input",
          "input"
        ],
        [
          "measured",
          "measured"
        ],
        [
          "ignore",
          "ignore"
        ],
        [
          "constant",
          "constant"
        ],
        [
          "term",
          "term"
        ],
        [
          "multiplication",
          "multiplication"
        ]
      ],
      "raw_glosses": [
        "(computer science) The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms."
      ],
      "tags": [
        "uncountable",
        "usually"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "translations": [
    {
      "code": "de",
      "lang": "German",
      "sense": "amount of time",
      "tags": [
        "feminine"
      ],
      "word": "Zeitkomplexität"
    },
    {
      "alt": "じかんけいさんりょう",
      "code": "ja",
      "lang": "Japanese",
      "roman": "jikankeisanryō",
      "sense": "amount of time",
      "word": "時間計算量"
    },
    {
      "code": "pl",
      "lang": "Polish",
      "sense": "amount of time",
      "tags": [
        "feminine"
      ],
      "word": "złożoność czasowa"
    }
  ],
  "word": "time complexity"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.