It's a fairly straightforward dynamic programming problem. I think the big issue is that we want to make sure that we short-circuit common simple cases so that there isn't a lot of overhead. You can probably hardcode this for a small number of chained matrix multiplies and just fall back on the dynamic programming algorithm when the chain is longer than four or something like that.
On Wed, Jun 4, 2014 at 12:18 PM, Kevin Squire <[email protected]> wrote: > > 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 >
