probabilistic complexity classes
Description: Classes of computational problems defined by resource-bounded algorithms that use randomness and meet specified probability-of-error requirements.
Primary topic: Complexity and Algorithms in Graphs (67%)
OpenAlex ID: keywords/probabilistic-complexity-classes
