Re:P might be NP: A Polynomial Time Algorithm for the Hamilt...
by raverbashing on Wednesday May 29, 2013 @11:09AM
(#5786678)
Yes, but as usually, the problem with O is the growth
In the same way that Insertion sort can be faster than Quicksort for small vectors, there's a number of elements from where even O(n^100) is quicker than O(n!)
Because the (practical) problem with NP problems is not when they are small, you can try every combination for a small TSP problem in a reasonable time.
But for big problems, even if it's n^100 instead of n! it'll be most likely faster than the existing algos.
Re:P might be NP: A Polynomial Time Algorithm for the Hamilt...
by im3w1l on Wednesday May 29, 2013 @07:19PM
(#5789898)
The problem is that, even though it is faster it isn't fast enough. You can't solve any real world large problems with a n^100 algo, even though it is faster in theory.
In the same way that Insertion sort can be faster than Quicksort for small vectors, there's a number of elements from where even O(n^100) is quicker than O(n!)
Because the (practical) problem with NP problems is not when they are small, you can try every combination for a small TSP problem in a reasonable time.
But for big problems, even if it's n^100 instead of n! it'll be most likely faster than the existing algos.