Which Fine-Grained Lower Bounds Survive the Refutation of 3SUM and APSP?
Source: hexagonmath.org/abs/2611.00388v1
Alman and Vassilevska Williams have refuted the 3SUM and APSP hypotheses. Their algorithms rest on counting the triangles through prescribed edges of lopsided tripartite graphs, whose middle part has $n^{\varepsilon}$ vertices for a small $\varepsilon$. Majdoddin extended the method to every $\varepsilon<\ln4/(5\ln5)\approx0.172$. We determine which of the main conditional lower bounds derived from the refuted hypotheses survive. We also prove that the method extends to every $\varepsilon<0.17843$ when the prescribed edges are known in advance and there are at most $n^{2-\varepsilon/2}$ of…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00388
curl -X POST /api/v1/records/hexagon/2611.00388/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00388/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'