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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.