P/poly

complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function
Thing complexity_class Q7117817
Press Enter · cited answer in seconds

P/poly

Summary

P/poly is a complexity class[1]. P/poly draws 30 Wikipedia views per month (complexity_class category, ranking #22 of 61).[2]

Key Facts

  • P/poly's instance of is recorded as complexity class[3].
  • P/poly's subclass of is recorded as computational problem[4].
  • P/poly's has part is recorded as P[5].
  • P/poly's has part is recorded as BPP[6].
  • P/poly's Freebase ID is recorded as /m/06hrjg[7].
  • P/poly's Microsoft Academic ID is recorded as 2779599195[8].

Why It Matters

P/poly draws 30 Wikipedia views per month (complexity_class category, ranking #22 of 61).[2] P/poly has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[9]

📑 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/poly. Retrieved May 3, 2026, from https://4ort.xyz/entity/p-poly
MLA “P/poly.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/p-poly.
BibTeX @misc{4ortxyz_p-poly_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{P/poly}}, year = {2026}, url = {https://4ort.xyz/entity/p-poly}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): P/poly — https://4ort.xyz/entity/p-poly (retrieved 2026-05-03)

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