Post #1078069

@colinstu many times, except I could never afford to actually do it :( For instance TSP-type problems go from O(n!) to 2^n if you also use 2^n of memory.