Round Complexity of Common Randomness Generation: The Amortized Setting

DOI10.1137/1.9781611975994.66MaRDI QIDQ5146837zbMATH OpenOpenAlexFDO

Authors Noah Golowich, Madhu Sudan

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.00323

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• A zero-one law for RP and derandomization of AM if NP is not small
• Low-End Uniform Hardness versus Randomness Tradeoffs for AM
• Amplification and Derandomization without Slowdown
• Spectral approach to the communication complexity of multi-party key agreement

This page was built for publication: Round Complexity of Common Randomness Generation: The Amortized Setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146837)