PP (complexity)

<table><tbody><tr><th colspan="3">PP algorithm</th></tr><tr><th>AnswerproducedCorrectanswer</th><th>Yes</th><th>No</th></tr><tr><th>Yes</th><td>> 1/2</td><td>< 1/2</td></tr><tr><th>No</th><td>< 1/2</td><td>> 1/2</td></tr></tbody></table>

<p>In <a href="/facts/Computational_complexity_theory/etHuVF3U">complexity theory</a>, PP, or PPT is the class of <a href="/facts/Decision_problem/cQNWjbdE">decision problems</a> solvable by a <a href="/facts/Probabilistic_Turing_machine/Vq1JTHSR">probabilistic Turing machine</a> in <a href="/facts/Polynomial_time/77T62gmf">polynomial time</a>, with an error probability of less than 1/2 for all instances. The abbreviation PP refers to probabilistic polynomial time. The complexity class was defined by Gill in 1977.
</p><p>If a decision problem is in PP, then there is an algorithm running in polynomial time that is allowed to make random decisions, such that it returns the correct answer with chance higher than 1/2. In more practical terms, it is the class of problems that can be solved to any fixed degree of accuracy by running a randomized, polynomial-time algorithm a sufficient (but bounded) number of times.
</p><p>Turing machines that are polynomially-bound and probabilistic are characterized as PPT, which stands for probabilistic polynomial-time machines. This characterization of Turing machines does not require a bounded error probability. Hence, PP is the complexity class containing all problems solvable by a PPT machine with an error probability of less than 1/2.
</p><p>An alternative characterization of PP is the set of problems that can be solved by a <a href="/facts/Nondeterministic_Turing_machine/zv2x6XPG">nondeterministic Turing machine</a> in polynomial time where the acceptance condition is that a majority (more than half) of computation paths accept. Because of this some authors have suggested the alternative name <i>Majority-P</i>.
</p>

PP (complexity) open-in-new

PP (complexity)