A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank

Radu Curticapean, Nathan Lindzey, Jesper Nederlof. A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pages 1080-1099, SIAM, 2018. [doi]

Abstract

Abstract is missing.