near-rings.

Balakrishnan, R.; Suryanarayanan, S.

Displaying similar documents to “ $P (r, m)$ near-rings.”

Piecewise polynomial interpolations in the finite element method

Stanislav Koukal (1973)

Aplikace matematiky

Similarity:

Algorithm 7. Evaluation of a trigonometric polynomial

Lucja Sobich (1970)

Applicationes Mathematicae

Similarity:

An algorithm for detecting “linear” solutions of nonlinear polynomial differential equations.

Kotsios, Stelios (2007)

Applied Mathematics E-Notes [electronic only]

Similarity:

Tetrahedral finite $C^{(m)}$ -elements

Alexander Ženíšek (1974)

Acta Universitatis Carolinae. Mathematica et Physica

Similarity:

Selected Chapters from Algebra, II

I. R. Shafarevich (1999)

The Teaching of Mathematics

Similarity:

Integral minimalisations improvement for Murphy's polynomial selection algorithm.

Jedlička, Přemysl (2010)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Similarity:

Algorithm 32. Construction of polynomial values orthogonal on given set of one-dimensional variable

Anna Bartkowiak (1974)

Applicationes Mathematicae

Similarity:

A polynomial reduction algorithm

Henri Cohen, Francisco Diaz Y Diaz (1991)

Journal de théorie des nombres de Bordeaux

Similarity:

The algorithm described in this paper is a practical approach to the problem of giving, for each number field $K$ a polynomial, as canonical as possible, a root of which is a primitive element of the extension $K / ℚ$ . Our algorithm uses the $L L L$ algorithm to find a basis of minimal vectors for the lattice of $ℝ^{n}$ determined by the integers of $K$ under the canonical map.

Displaying similar documents to “ P ( r , m ) near-rings.”

Displaying similar documents to “ $P (r, m)$ near-rings.”