Evaluating Rational Functions: Infinite Precision Is Finite Cost And Tractable On Average
Lenore Blum, Mike Shub · 1984
We consider the following generalization of the familiar '15-puzzle' which arises from issues in memory manngrment in distributed systems: Iet G be a graph with n vertices with k3) upper and lower bounds on the number of moves required. We have the following subexponential bound for certain unbounded cycles, one of which has prime length p ⩽ 2n/3, and G is primitive, then G = Anor Snand has diameter ⩽ 26 [(√(p+4))n8.