P/poly
complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function
Press Enter · cited answer in seconds
0 sources
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]