arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.11575cs.DS
收藏

精确三角形的更简单归约

Simpler Reductions from Exact Triangle

Timothy M. Chan, Yinzhan Xu

AI总结:

本文提出从精确三角形到具有少量零权重4-环的精确三角形及全边稀疏三角形的更简单归约,简化并加强现有条件下界至精确三角形假设,并给出确定性归约。

摘要:

在本文中,我们提供了从精确三角形问题到细粒度复杂度中两个重要问题的更简单归约:具有少量零权重4-环的精确三角形问题和全边稀疏三角形问题。具有少量零权重4-环的精确三角形实例曾被Jin和Xu [STOC 2023]考虑过,他们将其用作中间问题来证明具有少量4-环的全边稀疏三角形问题的3SUM难度(该结果由Abboud、Bringmann和Fischer [STOC 2023]独立获得),该问题进一步被用于证明多种问题的3SUM难度,包括4-环枚举、离线近似距离预言机、动态近似最短路径和全节点最短环。我们提供了从精确三角形到具有少量零权重4-环的精确三角形问题的简单归约。我们的新归约不仅简化了Jin和Xu之前的归约,还将条件下界从3SUM假设下加强到更可信的精确三角形假设下。因此,Jin和Xu [STOC 2023]以及Abboud、Bringmann和Fischer [STOC 2023]使用具有少量4-环的全边稀疏三角形作为中间问题所展示的所有条件下界现在也在精确三角形假设下成立。我们还提供了在精确三角形假设下全边稀疏三角形问题的条件下界的两个替代证明,该下界最初由Vassilevska Williams和Xu [FOCS 2020]证明。我们的两个新归约都更简单,其中一个是确定性的——所有先前从精确三角形或3SUM到全边稀疏三角形的归约(包括Pătraşcu的开创性工作 [STOC 2010])都是随机化的。

英文摘要:

In this paper, we provide simpler reductions from Exact Triangle to two important problems in fine-grained complexity: Exact Triangle with Few Zero-Weight $4$-Cycles and All-Edges Sparse Triangle. Exact Triangle instances with few zero-weight $4$-cycles was considered by Jin and Xu [STOC 2023], who used it as an intermediate problem to show $3$SUM hardness of All-Edges Sparse Triangle with few $4$-cycles (independently obtained by Abboud, Bringmann and Fischer [STOC 2023]), which is further used to show $3$SUM hardness of a variety of problems, including $4$-Cycle Enumeration, Offline Approximate Distance Oracle, Dynamic Approximate Shortest Paths and All-Nodes Shortest Cycles. We provide a simple reduction from Exact Triangle to Exact Triangle with few zero-weight $4$-cycles. Our new reduction not only simplifies Jin and Xu's previous reduction, but also strengthens the conditional lower bounds from being under the $3$SUM hypothesis to the even more believable Exact Triangle hypothesis. As a result, all conditional lower bounds shown by Jin and Xu [STOC 2023] and by Abboud, Bringmann and Fischer [STOC 2023] using All-Edges Sparse Triangle with few $4$-cycles as an intermediate problem now also hold under the Exact Triangle hypothesis. We also provide two alternative proofs of the conditional lower bound of the All-Edges Sparse Triangle problem under the Exact Triangle hypothesis, which was originally proved by Vassilevska Williams and Xu [FOCS 2020]. Both of our new reductions are simpler, and one of them is also deterministic -- all previous reductions from Exact Triangle or 3SUM to All-Edges Sparse Triangle (including Pătraşcu's seminal work [STOC 2010]) were randomized.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑