randomized communication complexity
Description: Randomized communication complexity measures the communication required for parties to compute a function when they may use random choices and bounded error.
Primary topic: Complexity and Algorithms in Graphs (77%)
OpenAlex ID: keywords/randomized-communication-complexity
