Complexity bound of absolute factoring of parametric polynomials.
Ayad, A. (2004)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Displaying similar documents to “Improvements on the Cantor-Zassenhaus factorization algorithm”
Complexity bound of absolute factoring of parametric polynomials.
Algorithm 7. Evaluation of a trigonometric polynomial
Lucja Sobich (1970)
Applicationes Mathematicae
Similarity:
Algorithm 32. Construction of polynomial values orthogonal on given set of one-dimensional variable
Anna Bartkowiak (1974)
Applicationes Mathematicae
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:
An algorithm to calculate the kernel of certain polynomial ring homomorphisms.
Di Biase, Fausto, Urbanke, Rüdiger (1995)
Experimental Mathematics
Similarity:
An algorithm for detecting “linear” solutions of nonlinear polynomial differential equations.
Kotsios, Stelios (2007)
Applied Mathematics E-Notes [electronic only]
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 a polynomial, as canonical as possible, a root of which is a primitive element of the extension . Our algorithm uses the algorithm to find a basis of minimal vectors for the lattice of determined by the integers of under the canonical map.
A polynomial preconditioner for the CMRH algorithm.
Lai, Jiangzhou, Lu, Linzhang, Xu, Shiji (2011)
Mathematical Problems in Engineering
Similarity:
Algorithm 10. Determination of the best polynomial in the sense of uniform approximation by the second algorithm of Remez
S. Paszkowski (1971)
Applicationes Mathematicae
Similarity: