Dana Ron, Rocco A. Servedio. Exponentially improved algorithms and lower bounds for testing signed majorities. Electronic Colloquium on Computational Complexity (ECCC), 20:96, 2013. [doi]
@article{RonS13-0,
title = {Exponentially improved algorithms and lower bounds for testing signed majorities},
author = {Dana Ron and Rocco A. Servedio},
year = {2013},
url = {http://eccc.hpi-web.de/report/2013/096},
researchr = {https://researchr.org/publication/RonS13-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {20},
pages = {96},
}