Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

DCC
2008
IEEE

favoriteEmaildiscussreport

118views Computer Graphics» more DCC 2008»

Probabilistic algorithm for finding roots of linearized polynomials

14 years 4 months ago

Probabilistic algorithm for finding roots of linearized polynomials

Download www.cs.technion.ac.il

A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented algorithm is O(nt) operations in Fqn . Keywords Linearized polynomials ? Probabilistic algorithms ? Root-finding algorithms ? Symbolic GCD

Vitaly Skachek, Ron M. Roth

Real-time Traffic

Computer Graphics | DCC 2008 | Keywords Linearized Polynomials | Probabilistic Algorithm | Probabilistic Algorithms |

claim paper

Related Content

» Finding roots of polynomials over finite fields

» Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial

» On Representations of AlgebraicGeometric Codes for List Decoding

» Finding Small Roots of Bivariate Integer Polynomial Equations Revisited

» Finding Small Roots of Bivariate Integer Polynomial Equations A Direct Approach

» Low Complexity Algorithms for Linear Recurrences

» Finitesample performance guarantees for onedimensional stochastic root finding

» Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots

» Exploration of multiple roots for a polynomial system

Post Info
More Details (n/a)

Added	25 Dec 2009
Updated	25 Dec 2009
Type	Conference
Year	2008
Where	DCC
Authors	Vitaly Skachek, Ron M. Roth

Comments (0)