Before revision:  Furthermore, if Small Set Expansion has an approximation algorithm with a ratio slightly better than \Theta(\log n), then a mimicking network of quasipolynomial size can be computed in polynomial time.
After revision:  Furthermore, if Small Set Expansion has an approximation algorithm with a ratio slightly better than \Theta(\log n), then a mimicking network of quasipolynomial size in polynomial time.