News for hackers. Stuff that matters.
Re:Secret Santa is NP-Complete (2006) by joe_the_user on Friday December 11, 2015 @04:57PM (#10720385)
While Hamiltonian Circuit is certainly harder, I don't think a Hamiltonian Circuit solver would be a Secret Santa Solver in all cases - two disjoint sets could have a Secret Santa solution but not a Hamiltonian graph solution.

There are no comments on this comment yet.