  We give an algorithm to compute stable commutator length in free products of
cyclic groups which is polynomial time in the length of the input, the number
of factors, and the orders of the finite factors. We also describe some
experimental and theoretical applications of this algorithm.
