The Round Complexity of Two-Party Random Selection

Saurabh Sanghvi, Salil P. Vadhan. The Round Complexity of Two-Party Random Selection. Electronic Colloquium on Computational Complexity (ECCC), (110), 2005. [doi]

Abstract

Abstract is missing.