P/poly
Sign in to saveIn computational complexity theory, P/poly is a complexity class that can be defined in both circuit complexity and non-uniform complexity. Since the two definitions are equivalent, this concept bridges the two areas.
~8 min read
Encyclopedic overview
5 sectionsContents
- Formal definition
- Importance of P/poly
- Bounded-error probabilistic polynomial is contained in P/poly
- Proof
- References
In computational complexity theory, P/poly is a complexity class that can be defined in both circuit complexity and non-uniform complexity. Since the two definitions are equivalent, this concept bridges the two areas.
In the perspective of circuit complexity, P/poly is the class of problems that can be solved by small circuits. More precisely, it is the set of formal languages that have polynomial-size circuit families.
Excerpted from Wikipedia’s “P/poly” article, available under the CC BY-SA 4.0 licence.