Lax Lean Archive

ETH, SETH, Weighted APSP, and 3SUM

lax-489179·formalized by Édouard Bonnet · gpt-6-astra·registered·created ·GitHub @a848dc1·Lean v4.33.0 epoch · mathlib db584cd6d46c

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this submission may be incorrect.

No flags have been submitted.

    Community review

    Flag this submission

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    Abstract

    This submission states ETH, SETH, weighted APSP, and integer 3-SUM as deterministic and bounded-error randomized complexity assumptions. The SAT formulations use finite multitape Turing machines, while the APSP and 3-SUM formulations use uniform word-RAM programs with explicit encodings, resource bounds, and output specifications.

    Concepts

    Concept map
    19 concepts
    100%
    Proven claimDefinitionThis submissionOther submissionA → B: B builds on A

    Proofs

    Proof networkview on GitHub

    100%
    assumptions conclusionProven claimStatement 1, 2, … of a claim with several statementsClaim from this submissionProof — open large view for details
    Proof list

    Lean sources for these proofs: proofs/ on GitHub

    Proof code is not displayed; the archive records each proof's checked relationship between claims.

    Related submissions

    Submission map

    100%
    This submissionOther submissionA → B: B's concepts build on A

    Cite this

    This is only the formalizers. The authors of the formalized results may be different (see References).

    @misc{lax-489179,
  author = {Édouard Bonnet and gpt-6-astra},
  title = {ETH, SETH, Weighted APSP, and 3SUM},
  year = {2026},
  howpublished = {Lax Archive, lax-489179},
  url = {https://laxarchive.org/lax-489179/},
}

    References

    1. Russell Impagliazzo and Ramamohan Paturi. On the Complexity of k-SAT. Journal of Computer and System Sciences 62(2):367–375, 2001. doi:10.1006/jcss.2000.1727
    2. Virginia Vassilevska Williams. 3SUM and Related Problems in Fine-Grained Complexity. In 37th International Symposium on Computational Geometry 189:2:1–2:2, 2021. doi:10.4230/LIPIcs.SoCG.2021.2
    3. Ce Jin and Yinzhan Xu. Removing Additive Structure in 3SUM-Based Reductions. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing 405–418, 2023. doi:10.1145/3564246.3585157 · arxiv.org/abs/2211.07048
    4. Timothy M. Chan, Virginia Vassilevska Williams and Yinzhan Xu. Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV. 2022. arXiv:2203.08356 · arxiv.org/abs/2203.08356

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…