{"id":"https://openalex.org/keywords/randomized-communication-complexity","display_name":"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.","display_name_alternatives":["randomised communication complexity","probabilistic communication complexity"],"ids":{"openalex":"https://openalex.org/keywords/randomized-communication-complexity","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0874,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":236,"cited_by_count":5815,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/randomized-communication-complexity","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
