Login / Signup
Polynominal time algorithms for discrete logarithms and factoring on a quantum computer.
Peter W. Shor
Published in:
ANTS (1994)
Keyphrases
</>
learning algorithm
computational complexity
computational efficiency
computational cost
theoretical analysis
neural network
data structure
search algorithm
upper bound
orders of magnitude
times faster
combinatorial optimization