Exponential Time Hypothesis refuted: subexponential 3-SAT, but graph alignment stays hard
JFPuget · x · 2026-11-07
Marc Lelarge shares new results: with the Exponential Time Hypothesis refuted, 3-SAT gets a subexponential algorithm, yet the harder graph alignment problem (GAP) remains hard. His team proposes a chain of GNNs to solve GAP, releasing code and models. The thread also clarifies graph isomorphism is neither known to be in P nor NP-complete; the attached figure formalizes GAP as Frobenius-norm minimization reducible to Hamiltonian path, minimum bisection, and maximum common subgraph.
More from Research
- Inkling 2 Small tops open-weight models on ARC-AGI-2 at $0.27/task, weights coming — LiTianleli · 2026-11-07
- SketchAgentBench: new benchmark tests 11 LLMs on 3D spatial reasoning from photos — wsxiaoys · 2026-11-07
- FDT decision-theory algorithm shown to defect in almost-twin prisoner's dilemma — jessi_cata · 2026-11-07
- New Benchmarks DecoyCount and ScienceVision Probe Whether Vision Models Fail at Seeing or Reasoning — AndrewDai · 2026-11-07
- BlancheMinerva argues withholding pre-camera-ready collaboration harms scientific practice — BlancheMinerva · 2026-11-07
- Aaronson-Ambainis conjecture caps query complexity, not super-polynomial quantum speedups in computation — thomasahle · 2026-11-07