Actually I'm not sure I have any O(n!) algorithms. There are two places I could have. One of them I capped n, the other I sped up to 2^n n^2
@DRMacIver Don't both of those tend to exponential? Vague memories of Stirling's approximation from a STEP paper we probably both did... ;)
-
-
@propensive Gosh no. n! is ridiculously superexponential. It's like n^n with some tiny baby exponential dampening factor. -
@DRMacIver So I guess the most important word in that last tweet was "vague", which goes for most of my maths recollections these days. ;) - Show replies
New conversation -
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.