Informally, the property of a string being not longer than any computer program that can produce that string; that is, the property of a string being incompressible.

(computing theory) An algorithm for merging the non-distinguishable states of a deterministic finite-state automaton, based on partitioning the states into groups by their behaviour.

(mathematics) The simplest description of the Robinson-Schensted correspondence; a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction.

(computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.

(computing theory) A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value.

hash function

plural of hash algorithm

A dynamic programming algorithm for finding the most likely sequence of hidden states (the Viterbi path) that results in a sequence of observed events.

A modulus-10 checksum algorithm used to validate various identification numbers, such as those on credit cards.

plural of approximation algorithm