A Majority Lemma for Randomised Query Complexity

Mika Göös, Gilbert Maystre. A Majority Lemma for Randomised Query Complexity. Electronic Colloquium on Computational Complexity (ECCC), 28:24, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.