StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Why is the travelling salesman prob. NP-hard while the Hamiltonian path prob. is NP-complete?
| Author | Votes | Δ |
|---|---|---|
| ifma | 7 | +6.13 |
| templatetypedef | 3 | -0.77 |
Last visited: Oct 27, 2016, 2:10:41 PM