2 citations · 3 across the 3 of their papers we have counts for
1 paper · 2 filters
Shuichi Hirahara, Rahul Ilango, Bruno Loff
In the paper where he first defined Communication Complexity, Yao asks: \emph{Is computing CC(f) (the 2-way communication complexity of a given function f) NP-complete?} The pr…