Exponentially improved algorithms and lower bounds for testing signed majorities

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]

Possibly Related Publications

The following publications are possibly variants of this publication: