P-complete

class in computational complexity theory
Thing complexity_class Q905789
Press Enter · cited answer in seconds

P-complete

Summary

P-complete is a complexity class[1]. P-complete draws 32 Wikipedia views per month (complexity_class category, ranking #24 of 61).[2]

Key Facts

  • P-complete's instance of is recorded as complexity class[3].
  • P-complete's part of is recorded as P[4].
  • P-complete's Freebase ID is recorded as /m/0f87m[5].
  • P-complete's Dictionary of Algorithms and Data Structures ID is recorded as pcomplete[6].
  • P-complete's Microsoft Academic ID is recorded as 80873429[7].

Why It Matters

P-complete draws 32 Wikipedia views per month (complexity_class category, ranking #24 of 61).[2] P-complete has Wikipedia articles in 6 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). P-complete. Retrieved May 3, 2026, from https://4ort.xyz/entity/p-complete
MLA “P-complete.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/p-complete.
BibTeX @misc{4ortxyz_p-complete_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{P-complete}}, year = {2026}, url = {https://4ort.xyz/entity/p-complete}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): P-complete — https://4ort.xyz/entity/p-complete (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/p-complete · Last refreshed: