3 ms·
Every NP problem can be converted in another NP problem, so you could probably try to convert your subset problem to a TSP problem (but it wouldn't be useful in
by raverbashing 13y ago
Every NP problem can be converted in another NP problem, so you could probably try to convert your subset problem to a TSP problem (but it wouldn't be useful in practice)
- a-nikolaev 13y agoNitpicking: In general, an NP problem can be reduced to an NP-hard problem (in poly-time).