3-SAT Gets Subexponential Algorithm After ETH Refuted; Graph Alignment Stays Hard

Marc Lelarge and collaborators report new results in combinatorial optimization: after the Exponential Time Hypothesis (ETH) was refuted, 3-SAT admits a subexponential algorithm, yet the harder Graph Alignment Problem remains difficult, with the team proposing a chain of GNNs to tackle it.

2026-11-07 ~ 2026-11-07 · 2 related posts

• With ETH Refuted, GNN Chains Tackle the Still-Hard Graph Alignment Problem — marc_lelarge · 2026-11-07
• Exponential Time Hypothesis refuted: subexponential 3-SAT, but graph alignment stays hard — JFPuget · 2026-11-07