Go backward to
Optimization
Go up to
Top
Go forward to
Parallel Algorithm
Time Analysis
n
nodes.
log n
square computations.
n
3
(min,
+
) operations for each square computation.
Sequential complexity
O(log n * n
3
)
Author:
Wolfgang Schreiner
Last modification: November 15, 1996
