Factoring Numbers in O(log n) Arithmetic Steps
暂无分享,去创建一个
Abstract : A non-trivial factor of a composite number n can be found by performing arithmetic steps in a number proportional to the number of bits in n, and thus there are extremely short straight-line factoring programs. However, this theoretical result does not imply that natural numbers can be factored in polynomial time in the Turing-Machine model of complexity, since the numbers operated on can be as big as 2 to the power c n-squared, thus requiring exponentially many bit operations.
[1] Vaughan R. Pratt. The competence/performance dichotomy in programming preliminary report , 1977, POPL '77.
[2] Vaughan R. Pratt,et al. The Competence/Performance Dichotomy in Programming , 1977 .
[3] Martin D. Davis. Hilbert's Tenth Problem is Unsolvable , 1973 .
[4] J. M. Pollard,et al. Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.
[5] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .