Search Results for ""

An algorithm for computing an Egyptian fraction.

A linear deconvolution algorithm.

A prime factorization algorithm.

An algorithm for computing an Egyptian fraction.

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...

A method for finding roots of a polynomial equation f(x)=0. Now find an equation whose roots are the roots of this equation diminished by r, so (1) The expressions for f(r), ...

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...

A quadrature (numerical integration) algorithm which has a number of desirable properties.

A field K is said to be algebraically closed if every polynomial with coefficients in K has a root in K.