Reproduce “ETH is Dead, Long Live SH” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
MIT Hardness Group, Josh Brunner, Erik D. Demaine, Fabian Frei, Timothy Gomez, Markus Hecher, Jeffery Li, Jayson Lynch
The authors show that the Satisfiability Hypothesis, which measures the full length of a CNF formula, is equivalent to Weak ETH and can support a general rule for transferring lower bounds through reductions. The rule tracks instance-size blowup and loses exponent strength. It recovers many ETH-based bounds conditionally, but not every fine-grained lower bound, including the k×k Clique bound.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.