< Browse > Home / Archive: March 2009

| RSS

Approximating Linear Cost Computation for Polynomial Cost Computation Problems

Polynomial cost computation is simply not scalable while linear cost computation is usually scalable depending on the angle of its growth slope. Fixed cost computation is almost always guaranteed to be scalable regardless of the data size. For this reason linear cost computation is always preferable to polynomial cost computation. The fact that fixed cost […]

[ More ] March 1st, 2009 | Comments Off on Approximating Linear Cost Computation for Polynomial Cost Computation Problems | Posted in Software Development |