It helps determine the largest problem instance that can be handled by a particular algorithm implementation (Bentley, 1999). (link)
Therefore, they assert that performance costs that differ by a multiplicative constant are asymptotically equivalent, or in other words, will not matter as the problem size continues to grow. (link)