RP
Description: RP is a computational complexity class containing decision problems solvable by randomized algorithms with polynomial running time and one-sided error.
Primary topic: Complexity and Algorithms in Graphs (52%)
Related topic: Complexity and Algorithms in Graphs (52%)
Wikidata ID: wiki/Q1190846
OpenAlex ID: keywords/rp
