A theorem on sensitivity and applications in private computation

DOI10.1145/301250.301340zbMath1345.94061OpenAlexW2040040725MaRDI QIDQ2819565

Adi Rosén, Anna Gál

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301340

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: A theorem on sensitivity and applications in private computation