Quantum algorithms and approximating polynomials for composed functions with shared inputs

DOI10.1137/1.9781611975482.42zbMath1431.68037arXiv1809.02254OpenAlexW2902332756MaRDI QIDQ5236223

Mark Bun, Robin Kothari, Justin Thaler

Publication date: 15 October 2019

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

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

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Algorithmic Polynomials ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage

This page was built for publication: Quantum algorithms and approximating polynomials for composed functions with shared inputs