Encyclopedia > P > P/poly


P/poly



In computational complexity theory, P/poly is the complexity class of languages recognized by a polynomial-time Turing machine with a polynomial-bounded advice function. It is also (equivalently) defined as the class of languages that have a polynomial-size non-uniform circuit family.



Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.

Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)


en