Considering the Travelling Salesman Problem (TSP), we can say:
a) It is a Class P problem.
b) Increasing the number of visiting cities, its complexity will not increase exponentially.
c) TSP does not appear as a sub-problem in many areas such as DNA sequencing.
d) This problem was studied by many researchers from mathematics, computer science, chemistry physics and other sciences and it is still considered an NP-Hard.
e) None of the above
Original idea by: Luiz Cobos
a) It is a Class P problem.
b) Increasing the number of visiting cities, its complexity will not increase exponentially.
c) TSP does not appear as a sub-problem in many areas such as DNA sequencing.
d) This problem was studied by many researchers from mathematics, computer science, chemistry physics and other sciences and it is still considered an NP-Hard.
e) None of the above
Original idea by: Luiz Cobos
