Synonym of computational number theory.

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.

(computing theory) A method for parsing mathematical expressions specified in infix notation.

(mathematics) A general-purpose integer factorization algorithm, particularly effective at splitting composite numbers with small factors.

plural of Bellman-Ford algorithm