Assertion: algorithm | /r/CapableOf | solve integer factorization problem
Facets:
value: in polynomial time
type: OTHER
Source sentences:
text: Shor's algorithm solves the discrete logarithm problem and the integer factorization problem in polynomial time, whereas the best known classical algorithms take super-polynomial time.