randomized polynomial-time algorithms
Description: Randomized algorithms whose running time is bounded by a polynomial in the input size, studied in computational complexity and algorithm design.
Primary topic: Complexity and Algorithms in Graphs (44%)
OpenAlex ID: keywords/randomized-polynomial-time-algorithms
