Search Results for ""

One of the set of symbols C_i, C_s, C_1, C_2, C_3, C_4, C_5, C_6, C_7, C_8, C_(2h), C_(3h), C_(4h), C_(5h), C_(6h), C_(2v), C_(3v), C_(4v), C_(5v), C_(6v), C_(inftyv), D_2, ...

Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...

An algorithm for determining the order of an elliptic curve E/F_p over the finite field F_p.

The circumcircle, Brocard circle, Lemoine axis, and isodynamic points belong to a coaxal system orthogonal to the Apollonius circles, called the Schoute coaxal system. In ...

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

The Schröder-Bernstein theorem for numbers states that if n<=m<=n, then m=n. For sets, the theorem states that if there are injections of the set A into the set B and of B ...

The Schroeder stairs, also called Schouten's staircase (Bool et al. 1982, p. 147), are an ambiguous figure that depicts two different staircases at the same time: one going ...

Two families of equations used to find roots of nonlinear functions of a single variable. The "B" family is more robust and can be used in the neighborhood of degenerate ...

The Schur decomposition of a complex square matrix A is a matrix decomposition of the form Q^(H)AQ=T=D+N, (1) where Q is a unitary matrix, Q^(H) is its conjugate transpose, ...

The p×p square matrix formed by setting s_(ij)=xi^(ij), where xi is a pth root of unity. The Schur matrix has a particularly simple determinant given by ...