Removing Additive Structure in 3SUM-Based Reductions-Reference-Cited by-同舟云学术

Removing Additive Structure in 3SUM-Based Reductions

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Jin Ce¹,Xu Yinzhan¹

Affiliation:

1. Massachusetts Institute of Technology, USA

Publisher

ACM

Link

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

Reference69 articles.

1. Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve

2. Amir Abboud , Arturs Backurs , Karl Bringmann , and Marvin Künnemann . 2020 . Impossibility results for grammar-compressed linear algebra . In Proceedings of the 34th International Conference on Neural Information Processing Systems (NeurIPS). 8810–8823 . Amir Abboud, Arturs Backurs, Karl Bringmann, and Marvin Künnemann. 2020. Impossibility results for grammar-compressed linear algebra. In Proceedings of the 34th International Conference on Neural Information Processing Systems (NeurIPS). 8810–8823.

3. Amir Abboud , Karl Bringmann , and Nick Fischer . 2022. Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. CoRR, abs/2211.07058 ( 2022 ), arXiv:2211.07058v1. To appear in STOC 2023 Amir Abboud, Karl Bringmann, and Nick Fischer. 2022. Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. CoRR, abs/2211.07058 (2022), arXiv:2211.07058v1. To appear in STOC 2023

4. Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond

5. Amir Abboud , Seri Khoury , Oree Leibowitz , and Ron Safier . 2022. Listing 4- Cycles . CoRR , abs/2211.10022 ( 2022 ), arXiv:2211.10022v1. Amir Abboud, Seri Khoury, Oree Leibowitz, and Ron Safier. 2022. Listing 4-Cycles. CoRR, abs/2211.10022 (2022), arXiv:2211.10022v1.

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

1. Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. On the Variants of Subset Sum: Projected and Unbounded;2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2023-09-11