Assertion: algorithm | /r/CapableOf | run in time
Facets:
Source sentences:
text: Another example is the graph isomorphism problem, where Luks's algorithm runs in time 2 O ( n log ⁡ n ) {\displaystyle 2^{O({\sqrt {n\log n}})}} .