(computer graphics) An algorithm that solves the problem of rendering a complicated image by recursive subdivision of a scene until areas are obtained that are trivial to compute.

An algorithm for computing the value of a transcendental number, generating its digits sequentially with increasing precision.

(logic) An algorithm for checking the validity of a first-order logic formula using a resolution-based decision procedure for propositional logic.

(numerical analysis) An algorithm that significantly reduces the numerical error in the total obtained by adding a sequence of finite-precision floating-point numbers, compared to the obvious approach, by tracking the accumulated small errors in a separate variable.

An inference algorithm for hidden Markov models which computes the posterior marginals of all hidden state variables given a sequence of observations/emissions. It uses dynamic programming to compute the values in two passes, the first going forward in time and the second backward.

An algorithm for finding a solution to the stable marriage problem in polynomial time.

(computer science) An algorithm for matrix multiplication.

A method for minimization of Boolean functions, functionally identical to Karnaugh mapping, but having a tabular form that is more efficient in computer algorithms. It is based on finding prime implicants.

(computing theory) An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.

(computing) A search procedure which involves generating and checking all possible scenarios.