Author:
Ajtai Miklos,Ben-Or Michael
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal Explicit Small-Depth Formulas for the Coin Problem;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Tight Space Complexity of the Coin Problem;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
3. Quantum algorithms and approximating polynomials for composed functions with shared inputs;Quantum;2021-09-16
4. A robust version of Hegedus’s lemma, with applications;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06
5. Interactive shallow Clifford circuits: quantum advantage against NC¹ and beyond;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06