pseudo-polynomial time

Term in Complexity Theory
Thing complexity_class Q155291
Press Enter · cited answer in seconds

pseudo-polynomial time

Summary

pseudo-polynomial time is a complexity class[1]. It draws 52 Wikipedia views per month (complexity_class category, ranking #15 of 61).[2]

Key Facts

  • pseudo-polynomial time's instance of is recorded as complexity class[3].
  • pseudo-polynomial time's has part is recorded as weak NP-completeness[4].
  • pseudo-polynomial time's Freebase ID is recorded as /m/08vmbm[5].
  • pseudo-polynomial time's topic's main category is recorded as Category:Pseudo-polynomial time algorithms[6].
  • pseudo-polynomial time's Microsoft Academic ID is recorded as 167907120[7].

Why It Matters

pseudo-polynomial time draws 52 Wikipedia views per month (complexity_class category, ranking #15 of 61).[2] It has Wikipedia articles in 12 language editions, a strong signal of global cultural recognition.[8]

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). pseudo-polynomial time. Retrieved May 3, 2026, from https://4ort.xyz/entity/pseudo-polynomial-time
MLA “pseudo-polynomial time.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/pseudo-polynomial-time.
BibTeX @misc{4ortxyz_pseudo-polynomial-time_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{pseudo-polynomial time}}, year = {2026}, url = {https://4ort.xyz/entity/pseudo-polynomial-time}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): pseudo-polynomial time — https://4ort.xyz/entity/pseudo-polynomial-time (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/pseudo-polynomial-time · Last refreshed: