Reproduce “Explicit Constants for Subexponential #k-SAT: Quantitative Tensor Contraction, Sparsification and Sparse Networks” 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
Bjarne Vandenbroek
The authors refine #3-SAT counting by encoding counts as Boolean tensor networks and recursively contracting them. Newton finite-difference modes have stronger powers-of-two divisibility, allowing more interaction combinations to be discarded; improved networks also reduce wire counts. For 3-CNFs with m≤4.27n and every variable occurring, deterministic time is (n+m)^c'2^0.99n under a stated size condition. This bounds only the exponential factor and assumes OpenAI’s unrefereed result.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.