What “ Provably Fast ” Can Mean in Practice : A Case Study with a Combinatorial Laplacian Solver ∗