Alexander A. Sherstov. Communication Lower Bounds Using Dual Polynomials. Electronic Colloquium on Computational Complexity (ECCC), 15(057), 2008. [doi]
@article{Sherstov08:3,
title = {Communication Lower Bounds Using Dual Polynomials},
author = {Alexander A. Sherstov},
year = {2008},
url = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-057/index.html},
researchr = {https://researchr.org/publication/Sherstov08%3A3},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {15},
number = {057},
}