An algorithm computes hafnians and directed Hamiltonian cycle counts in time 2^{n - Ω(√n)}, improving the 2019 exponent by removing the log-log factor in the square-root term.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Counting perfect matchings and Hamiltonian cycles faster
An algorithm computes hafnians and directed Hamiltonian cycle counts in time 2^{n - Ω(√n)}, improving the 2019 exponent by removing the log-log factor in the square-root term.