The second reduction is treated in [1]}
and involves a potentially quadratic blowup of the instance size. So the
bounds that we can infer for the algorithm of
[2]} are quadratic – worse than our
linear time result.
