PP
Description: A complexity class, usually denoting probabilistic polynomial time, comprising decision problems solvable by a probabilistic polynomial-time algorithm with bounded error.
Primary topic: Complexity and Algorithms in Graphs (24%)
Wikidata ID: wiki/Q1563053
OpenAlex ID: keywords/pp
