View Single Post
damgo
#9
Mar22-03, 12:17 PM
P: n/a
The # of paths in the traveling salesman problem go as Permutations(n) = n! ~ (n/e)^n (Stirling's approx). The # of polytopes is slower, ~2^n , since order does not matter.

If you want to see *really* quickly increasing things, try Ackerman's function, or the Busy Beaver function.