You must log in or register to comment.
Yeah, I got a problem with n^{logn}, wtf is that monstrosity??
Apparently that’s quasi polynomial time, which grows faster than polynomial time but not quite as fast as exponential time.
stack overflow
You got a problem for your algorithm, professor?
