More specifically, it uses six function evaluations to calculate fourth- and fifth-order accurate solutions.

One possibility is to use more function evaluations.

First, the number of function evaluations needed increases rapidly with the number of dimensions.

These all form instances of secure function evaluation.

The assumption of bounded-quantum-storage has also been applied outside the realm of secure function evaluation.

Like lambda calculus, it supports a uniform treatment of function evaluation.

This approach requires the function evaluations to grow exponentially as the number of dimensions increases.

The solution with the function value can be found after 325 function evaluations.

For actual use, one will want to modify it so that the minimum of two function evaluations are performed.

It is not difficult to show that the number of function evaluations can never be higher than for Floyd's algorithm.