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

This work lists 2 machine contributors.

Machine contributors are recorded on the work, not on a single version. Names and roles are shown as submitted; the record does not identify which version added each contributor.