# Definitions for **PP**

### This page provides all possible meanings and translations of the word **PP**

### Wiktionary

pp(Abbreviation)

Pages.

### Freebase

PP

In complexity theory, PP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, 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. If a decision problem is in PP, then there is an algorithm for it that is allowed to flip coins and make random decisions. It is guaranteed to run in polynomial time. If the answer is YES, the algorithm will answer YES with probability more than 1/2. If the answer is NO, the algorithm will answer YES with probability less than or equal to 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 number of times. An alternative characterization of PP is the set of problems that can be solved by a nondeterministic Turing machine in polynomial time where the acceptance condition is that a majority of computation paths accept. Because of this some authors have suggested the alternative name Majority-P.

### British National Corpus

Nouns Frequency

Rank popularity for the word 'PP' in Nouns Frequency: #772

# Translations for **PP**

### From our Multilingual Translation Dictionary

### Get even more translations for PP »

# Translation

#### Find a translation for the **PP** definition in other languages:

Select another language:

#### Discuss these PP definitions with the community:

# Word of the Day

#### Would you like us to send you a **FREE** new word definition delivered to your inbox daily?

# Citation

## Use the citation below to add this definition to your bibliography:

"PP." *Definitions.net.* STANDS4 LLC, 2016. Web. 8 Feb. 2016. <http://www.definitions.net/definition/PP>.