Search Results for ""

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

A specific prescription for carrying out a task or solving a problem. Also called an algorithm, method, or technique

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

A stochastic approximation method that functions by placing conditions on iterative step sizes and whose convergence is guaranteed under mild conditions. However, the method ...

Following Ramanujan (1913-1914), write product_(k=1,3,5,...)^infty(1+e^(-kpisqrt(n)))=2^(1/4)e^(-pisqrt(n)/24)G_n (1) ...

The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...

Let a^p+b^p=c^p be a solution to Fermat's last theorem. Then the corresponding Frey curve is y^2=x(x-a^p)(x+b^p). (1) Ribet (1990a) showed that such curves cannot be modular, ...

Differential evolution is a stochastic parallel direct search evolution strategy optimization method that is fairly fast and reasonably robust. Differential evolution is ...

The elliptic lambda function lambda(tau) is a lambda-modular function defined on the upper half-plane by lambda(tau)=(theta_2^4(0,q))/(theta_3^4(0,q)), (1) where tau is the ...