We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree n over a finite field F_q, the average-case complexity of our algorithm is an ...
A collection of functions for working modular arithmetic, polynomials over finite fields, and related things. Implements factorization of 64 bit numbers using trial division, Pollard's Rho algorithm ...
Transactions of the American Mathematical Society, Vol. 216 (Feb., 1976), pp. 237-248 (12 pages) Conical polynomials are defined as certain polynomials in quadratic elements of the universal ...
An iterative technique is displayed whereby factors of arbitrary degree can be found for polynomials in one variable. Convergence is shown to occur always if a certain Jacobian does not vanish and if ...
Factorization theorems are obtained for selfadjoint operator polynomials $\mathrm{L}\left(\mathrm{\lambda }\right):=\sum _{\mathrm{j}=0}^{\mathrm{n}}{\mathrm{\lambda ...
An illustration of a magnifying glass. An illustration of a magnifying glass.
Abstract: A fast transversal filter for the numerical factorization of polynomials is presented. When all zeros of a polynomial are of different modulus, this algorithm can be used for the ...
A method of iteration is developed in terms of a function of somewhat arbitrary character. Sufficient conditions are given for convergence of the process, yielding factors of arbitrary degree for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback