Assertion: algorithm's time | /r/HasProperty | 2 n \displaystyle o(2^{n
Facets:
Source sentences:
text: Nevertheless, the solution algorithm is applicable to any size problem, and since the algorithm running time is O ( 2 n ) {\displaystyle O(2^{n})} the problem is NP-hard.