Counting Hamiltonian cycles in sparse graphs in subexponential time, assuming the new #SAT algorithms

Every version keeps its own PDF, citation, and review record — endorsements are bound to the version they examined and never carry forward silently.