Search Results for ""

A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...

The Lambert azimuthal equal-area projection is a map projection having transformation equations x = k^'cosphisin(lambda-lambda_0) (1) y = ...

Let lambda be the longitude, lambda_0 the reference longitude, phi the latitude, phi_0 the reference latitude, and phi_1 and phi_2 the standard parallels. Then the ...

For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

Let F be the set of complex analytic functions f defined on an open region containing the closure of the unit disk D={z:|z|<1} satisfying f(0)=0 and df/dz(0)=1. For each f in ...

The Laplace distribution, also called the double exponential distribution, is the distribution of differences between two independent variates with identical exponential ...

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...