On Tuesday, June 3, 2014, Stefan Karpinski <[email protected]> wrote:
> Shouldn't be hard though. > For a few terms (which should be the most common use case), this is true. I'm curious what's possible now when the number of terms grows. Early in grad school, I vaguely remember this presented as a nice example of a combinatorial optimization problem. Cheers, Kevin
