A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank.
Radu CurticapeanNathan LindzeyJesper NederlofPublished in: SODA (2018)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- np hard
- singular values
- worst case
- nuclear norm minimization
- singular value decomposition
- lower and upper bounds
- lower bounding
- objective function
- vc dimension
- graph coloring
- matrix representation
- upper and lower bounds
- rank order
- low rank
- max sat
- computational complexity
- low rank approximation