FPRAS
Description: A fully polynomial randomized approximation scheme, an algorithm that approximates a counting quantity with controlled error and probability in polynomial time.
Primary topic: Complexity and Algorithms in Graphs (45%)
OpenAlex ID: keywords/fpras
