[GiNaC-list] Complexity bounds on expression expansion

Hi! I'm really new to the list, but I've been using GiNaC for 1 year aprox. in a scientific application. But now, we've to guarantee some bounds over the temporal complexity of some parts of the algorithm, and well, GiNaC is involved. 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. Is there any bound on the complexity of this operation in GiNaC? Thanks a lot!! Fede