Trading even more memory for the acceleration of the computation, one might precompute all entries of the matrix A, which is only feasible for small [N.
5) first and precompute optimised entries for the sparse matrix B to achieve higher accuracy [30, 31].
One possibility is to precompute all values [phi]([x.
In contrast, algorithms that perform static cost computations, precompute relative costs, and store differential costs for nonterminals.
We next precompute sets of augmented items that are valid for all augmented viable prefixes induced by the same input string.
Matt Bishop's fast version of crypt( )  does all of these things and also precomputes
even more functions, yielding twice the performance of the worm's algorithm but requiring nearly 200 KB of initialized data as opposed to the 6 KB used by the worm and the less than 2 KB used by the normal crypt( ).
search that expands blocks rather than vertices (by putting blocks onto the open list) and, for every block, precomputes
paths from every fringe vertex of the block (that is, every vertex along the border of the block) to every other fringe vertex of the block and stores (them and) their lengths in a lookup table to speed up the [A.