Computational Concentration of Measure: Optimal Bounds, Reductions, and More

DOI10.1137/1.9781611975994.21OpenAlexW3002604948MaRDI QIDQ5146786

Mohammad Mahmoody, Omid Etesami, Saeed Mahloujifar

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/1907.05401

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin ⋮ Polynomial-time targeted attacks on coin tossing for any number of corruptions

This page was built for publication: Computational Concentration of Measure: Optimal Bounds, Reductions, and More