Assertion: algorithm's time | /r/CapableOf | solve for an instance inputof size n
Facets:
Source sentences:
text: Formally, suppose that we have a lower-bound theorem showing that a problem requires Ω(f(n)) time to solve for an instance (input) of size n (see big-O notation for the definition of Ω).