9 citations · 11 across the 4 of their papers we have counts for
1 paper · 1 filter
Andreas Björklund, Thore Husfeldt
We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. Fo…