Assertion: classical algorithm | /r/CapableOf | take super-polynomial time
Facets:
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.