Recently, this method was implemented in geostatistical simulation which could provide a fast algorithm.

That can be significantly reduced with any of several fast algorithms.

Even if you had the fastest processors and blindingly fast algorithms, a search would still take days.

Generalization of distributive law leads to a large family of fast algorithms.

Very fast algorithms are available for finding the closest points on the surface of two convex polyhedral objects.

There is no hard and fast algorithm.

This makes the test a fast polynomial-time algorithm.

Parameterization: Often there are fast algorithms if certain parameters of the input are fixed.

The key to a fast algorithm, however, is how this merging is done.

"A fast bit-vector algorithm for approximate string matching based on dynamic programming."