Bicubic interpolation can be regarded as a computationally efficient approximation to Lanczos resampling. This finding motivates the search for algorithms which are computationally tractable and approximate the solution. However, they often rely on computationally intensive computer vision algorithms with extreme latency requirements. Nonlinear dimensionality reduction techniques tend to be more computationally demanding than PCA. Statistical potentials are more computationally efficient than energy calculations. This allowed Folding@home to run biomedical calculations that would have been otherwise infeasible computationally. Molecular docking research focuses on computationally simulating the molecular recognition process. In computer science, local search is a heuristic method for solving computationally hard optimization problems. RSA is based on the assumption that factoring large integers is computationally intractable. Among mathematical constants with computationally challenging decimal expansions, only has been calculated more precisely. This involves fewer multiplications and is therefore computationally faster. Kinetic models are generally more computationally intensive than fluid models. This ignores locality of reference in image data, both computationally and semantically. These are potentially very computationally complicated, however. Bayesian updating is widely used and computationally convenient.