Jisho

×
PP (計算複雑性理論)
Links
Wikipedia definition
1. PP (complexity)​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.
Read “PP (complexity)” on English Wikipedia
Read “PP (計算複雑性理論)” on Japanese Wikipedia
Read “PP (complexity)” on DBpedia

Discussions

to talk about this word.