3 ms·
Perhaps I simply know different people but I'm accustomed to Travelling Salesman, without explaining which version is intended, being given as the canonical NP-
by gilgoomesh 14y ago
Perhaps I simply know different people but I'm accustomed to Travelling Salesman, without explaining which version is intended, being given as the canonical NP-Hard (implicitly the optimal solution problem).
I normally see SAT given as the NP-complete example.
- jcd748 14y agoYes, I've always seen SAT as the canonical example given. Though, when I did some reading into phase transitions in NP-complete problems, 3-SAT was usually the example given (and used).