Arxiv – Pretending to factor large numbers on a quantum computer – Shor’s algorithm for factoring in polynomial time on a quantum computer gives an enormous advantage over all known classical ...
SIAM Journal on Numerical Analysis, Vol. 11, No. 6 (Dec., 1974), pp. 1087-1104 (18 pages) A composite algorithm has been designed for finding zeros of real polynomials. The algorithm has proved to be ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback