A Simple Algorithm for Undirected Hamiltonicity.

We develop a new algebraic technique that gives a simple randomized algorithm for the simple k-path problem with the same complexity O∗(1.657k) as in [1] and [3].