Title | ||
---|---|---|
An Efficient Randomized Protocol for every Karchmer-Wigderson Relation with Two Rounds. |
Year | Venue | Field |
---|---|---|
2017 | Electronic Colloquium on Computational Complexity (ECCC) | Discrete mathematics,Combinatorics,Mathematics |
DocType | Volume | Citations |
Journal | 24 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |