SAT and Polytime Reductions
Since any input x for L can be reduced to SAT in O(|x|^c) time, the created SAT instance will have size at most n=O(|x|^c).  So the n^(lg n)-time algorithm for SAT will be an |x|^O(lg |x|)-time algorithm for L.