nonuniform polynomial time in English

[Show JSON for post-processed kaikki.org data shown on this page ▼] [Hide JSON for post-processed kaikki.org data shown on this page ▲]

{
  "forms": [
    {
      "form": "nonuniform polynomial times",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "nonuniform polynomial time (countable and uncountable, plural nonuniform 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": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The class of decision problems solvable by a family of polynomial-sized Boolean circuits."
      ],
      "id": "en-nonuniform_polynomial_time-en-noun-ItNXuc6a",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "computational complexity theory",
          "computational complexity theory"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "solvable",
          "solvable"
        ],
        [
          "family",
          "family"
        ],
        [
          "polynomial",
          "polynomial"
        ],
        [
          "size",
          "size"
        ],
        [
          "Boolean circuit",
          "Boolean circuit"
        ]
      ],
      "qualifier": "computational complexity theory",
      "raw_glosses": [
        "(computer science, computational complexity theory) The class of decision problems solvable by a family of polynomial-sized Boolean circuits."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "nonuniform polynomial time"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "forms": [
    {
      "form": "nonuniform polynomial times",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "nonuniform polynomial time (countable and uncountable, plural nonuniform 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",
        "en:Computer science"
      ],
      "glosses": [
        "The class of decision problems solvable by a family of polynomial-sized Boolean circuits."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "computational complexity theory",
          "computational complexity theory"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "solvable",
          "solvable"
        ],
        [
          "family",
          "family"
        ],
        [
          "polynomial",
          "polynomial"
        ],
        [
          "size",
          "size"
        ],
        [
          "Boolean circuit",
          "Boolean circuit"
        ]
      ],
      "qualifier": "computational complexity theory",
      "raw_glosses": [
        "(computer science, computational complexity theory) The class of decision problems solvable by a family of polynomial-sized Boolean circuits."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "nonuniform polynomial time"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-07-01 from the enwiktionary dump dated 2024-06-20 using wiktextract (e79c026 and b863ecc). 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.

"nonuniform polynomial time" meaning in English

Noun

Inflected forms