Results Of Valiant’s Algorithm
Theoretically interesting ... the maximum function is extremely easy to compute
Could this be used in practice? Many cases where max is used, e.g. for loop control Jacobi iteration, there is little slack; would certainly be worse than Ladner/Fischer
Does this really lead one to develop a practically efficient parallel computation?