我正在阅读这篇文章:p-versus-np
看到了这个:
"The creation of all permutations for a given range with the length n is not bounded, as you have n! different permutations. This means that the problem could be solved in n^(100) log n, which will take a very long time, but this is still considered fast."
有人可以解释一下如何n!可在 n^(100) log n 中求解