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?
You joke, but I’ve actually encountered many people this standoffish about their designs in my career.
A time complexity of N to the power of logN?
I can see why someone might have a problem with that.
