Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model-Reference-Cited by-同舟云学术

Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model

Published:2024-06-10 Issue: Volume:11 Page:1805-1815
ISSN:
Container-title:Proceedings of the 56th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Kallaugher John¹^ORCID,Parekh Ojas¹^ORCID,Voronova Nadezhda²^ORCID

Affiliation:

1. Sandia National Laboratories, Albuquerque, USA

2. Boston University, Boston, USA

Funder

Sandia National Laboratories

NSF (National Science Foundation)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3618260.3649709

Reference25 articles.

1. The space complexity of approximating the frequency moments

2. Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar. 2002. Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’02). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA. 623–632. isbn:0-89871-513-X http://dl.acm.org/citation.cfm?id=545381.545464

3. Joshua Brakensiek Neng Huang Aaron Potechin and Uri Zwick. 2022. Separating MAX 2-AND MAX DI-CUT and MAX CUT. arXiv preprint arXiv:2212.11191.

4. Vladimir Braverman, Rafail Ostrovsky, and Dan Vilenchik. 2013. How hard is counting triangles in the streaming model? In Automata, Languages, and Programming. Springer, 244–254.

5. Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10