High-degree polynomial complexity is indistinguishable from exponential complexity (or worse) for all practical purposes.https://twitter.com/Atrix256/status/1199822770525200384 …
-
-
A large enough constant time factor in your algorithm makes the distinction between NP and P pointless exercise.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
(I'm going first)