Buy Me a Coffee at ko-fi.com

Pp

complexity class of decision problems solvable by a probabilistic Turing machine in polynomial time with error probability <½ for all instances

Pronunciation
/piːˈpiː/
/ˌpiˈpi/