Search Results for ""

An O(nlgn) sorting algorithm which is not quite as fast as quicksort. It is a "sort-in-place" algorithm and requires no auxiliary storage, which makes it particularly concise ...

A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...

A generalization of the Bulirsch-Stoer algorithm for solving ordinary differential equations.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

A fast Fourier transform-like algorithm which produces a hologram of an image.

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

The complexity of a pattern parameterized as the shortest algorithm required to reproduce it. Also known as bit complexity.

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.

A precise sequence of instructions designed to accomplish a given task. The implementation of an algorithm on a computer using a programming language is an example of a ...