Revision as of 06:18, 3 February 2009 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits →Derivation ← Previous edit		Revision as of 06:19, 3 February 2009 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits →Derivation Next edit →
Line 36: This recursive relationship allows for the calculation of all ''G''(''N'') up to any value of ''N'' in [[Big O notation\|order]] O(''MN''<sup>2</sup>) time. There is a more efficient algorithm for finding ~~<math>~~''G''(''N''')~~</math>~~ for some network. If it is assumed that <math>f_{i>1}( n ) = c_iy_i^n</math>, then the recursive relationship can be simplified as follows: : <math>

Buzen's algorithm: Difference between revisions