toIPA
Home
Blog
Category
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/
Categories
computational problem
complexity class