[GiNaC-list] Complexity bounds on expression expansion

[Richard B. Kreckel]

Federico Fernandez wrote:

> In resume, we've to calculate the complexity bound (at least in a
> general manner) of some expressions expansion. The type of expresion
> is a sum of a_is, like a1 + a2 + ... + a_n, powered to the m-th.


That expansion would be done by member function power::expand_add(const 
add&, int m) inside source file power.cpp.  Please have a look and the 
answer will become apparent, I suspect.

Regards
  -richy.

-- 
Richard B. Kreckel
<http://www.ginac.de/~kreckel/>