Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Work
Year: 2010
Type: article
Source: Computational Complexity
Authors Nikos Leonardos, Michael Saks
Institution Rutgers, The State University of New Jersey
Cites: 19
Cited by: 20
Related to: 10
FWCI: 1.87
Citation percentile (by year/subfield): 83.81
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Sustainable Development Goal Quality education
Open Access status: closed