The algorithm polynomial time complexity is a big joke！

Yongjiang Jiang

Email: accsys@126.com

Any natural number x can be expressed as x= , Where a_i is 0 or 1. So that we have x^k = .

Thus O(x^k) = O(2^nk), here n is a variable.

The polynomial time becomes the exponential time!

Is the algorithm polynomial time complexity is not a big joke?

2015-6-6