|||
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 ai is 0 or 1. So that we have xk = .
Thus O(xk) = O(2nk), 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
Archiver|手机版|科学网 ( 京ICP备07017567号-12 )
GMT+8, 2024-5-30 09:13
Powered by ScienceNet.cn
Copyright © 2007- 中国科学报社