"pseudo-polynomial time" meaning in All languages combined

See pseudo-polynomial time on Wiktionary

Noun [English]

Audio: LL-Q1860 (eng)-Flame, not lame-pseudo-polynomial time.wav Forms: pseudo-polynomial times [plural]
Head templates: {{en-noun|~}} pseudo-polynomial time (countable and uncountable, plural pseudo-polynomial times)
  1. (computer science, computational complexity theory) A time algorithm whose running time is a polynomial in the numeric value of the input, but not necessarily in the length of the input. Tags: countable, uncountable Categories (topical): Computer science

Inflected forms

{
  "forms": [
    {
      "form": "pseudo-polynomial times",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "pseudo-polynomial time (countable and uncountable, plural pseudo-polynomial times)",
      "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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A time algorithm whose running time is a polynomial in the numeric value of the input, but not necessarily in the length of the input."
      ],
      "id": "en-pseudo-polynomial_time-en-noun-W2ag25Mj",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "computational complexity theory",
          "computational complexity theory"
        ],
        [
          "time algorithm",
          "time algorithm"
        ],
        [
          "running time",
          "running time"
        ],
        [
          "polynomial",
          "polynomial"
        ],
        [
          "numeric",
          "numeric"
        ],
        [
          "value",
          "value"
        ],
        [
          "input",
          "input"
        ],
        [
          "necessarily",
          "necessarily"
        ],
        [
          "length",
          "length"
        ]
      ],
      "qualifier": "computational complexity theory",
      "raw_glosses": [
        "(computer science, computational complexity theory) A time algorithm whose running time is a polynomial in the numeric value of the input, but not necessarily in the length of the input."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Flame, not lame-pseudo-polynomial time.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/9/93/LL-Q1860_%28eng%29-Flame%2C_not_lame-pseudo-polynomial_time.wav/LL-Q1860_%28eng%29-Flame%2C_not_lame-pseudo-polynomial_time.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/9/93/LL-Q1860_%28eng%29-Flame%2C_not_lame-pseudo-polynomial_time.wav/LL-Q1860_%28eng%29-Flame%2C_not_lame-pseudo-polynomial_time.wav.ogg"
    }
  ],
  "word": "pseudo-polynomial time"
}
{
  "forms": [
    {
      "form": "pseudo-polynomial times",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "pseudo-polynomial time (countable and uncountable, plural pseudo-polynomial times)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "glosses": [
        "A time algorithm whose running time is a polynomial in the numeric value of the input, but not necessarily in the length of the input."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "computational complexity theory",
          "computational complexity theory"
        ],
        [
          "time algorithm",
          "time algorithm"
        ],
        [
          "running time",
          "running time"
        ],
        [
          "polynomial",
          "polynomial"
        ],
        [
          "numeric",
          "numeric"
        ],
        [
          "value",
          "value"
        ],
        [
          "input",
          "input"
        ],
        [
          "necessarily",
          "necessarily"
        ],
        [
          "length",
          "length"
        ]
      ],
      "qualifier": "computational complexity theory",
      "raw_glosses": [
        "(computer science, computational complexity theory) A time algorithm whose running time is a polynomial in the numeric value of the input, but not necessarily in the length of the input."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Flame, not lame-pseudo-polynomial time.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/9/93/LL-Q1860_%28eng%29-Flame%2C_not_lame-pseudo-polynomial_time.wav/LL-Q1860_%28eng%29-Flame%2C_not_lame-pseudo-polynomial_time.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/9/93/LL-Q1860_%28eng%29-Flame%2C_not_lame-pseudo-polynomial_time.wav/LL-Q1860_%28eng%29-Flame%2C_not_lame-pseudo-polynomial_time.wav.ogg"
    }
  ],
  "word": "pseudo-polynomial time"
}

Download raw JSONL data for pseudo-polynomial time meaning in All languages combined (2.0kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-25 from the enwiktionary dump dated 2025-01-20 using wiktextract (c15a5ce and 5c11237). 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.