Assertion: classical algorithm | /r/CapableOf | run in super-polynomial time
Facets:
Source sentences:
text: It is also one of the few quantum algorithms that solves a non–black-box problem in polynomial time where the best known classical algorithms run in super-polynomial time.