Assertion: algorithm | /r/AtLocation | many cases
Facets:
Source sentences:
text: An algorithm that requires superpolynomial time lies outside the complexity class P. Cobham's thesis posits that these algorithms are impractical, and in many cases they are.