The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time - excluding the reduction step - becoming proportional to $log_2(2n-1)$.

翻译：本文阐述了如何将二维递推问题简化为可应用Kogge与Stone算法的单维递推问题，使得计算时间（不包括简化步骤）与 $log_2(2n-1)$ 成正比。