Sciweavers

205 search results - page 7 / 41

» Complexity of Polynomial Multiplication over Finite Fields

55

FFA
2010

84views more FFA 2010»

Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field

14 years 9 months ago

Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field

Download www.math.uiuc.edu

Paul Pollack

claim paper

Read More »

58

FFA
2010

81views more FFA 2010»

Permutations, hyperplanes and polynomials over finite fields

14 years 9 months ago

Permutations, hyperplanes and polynomials over finite fields

Download www.cs.elte.hu

András Gács, Tamás Hég...

claim paper

Read More »

64

FFA
2010

82views more FFA 2010»

Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2

14 years 9 months ago

Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2

Download titan.math.udel.edu

Jiyou Li, David B. Chandler, Qing Xiang

claim paper

Read More »

63

JCT
2011

85views more JCT 2011»

Relatively prime polynomials and nonsingular Hankel matrices over finite fields

14 years 6 months ago

Relatively prime polynomials and nonsingular Hankel matrices over finite fields

Download www.math.iitb.ac.in

Mario García-Armas, Sudhir R. Ghorpade, Sam...

claim paper

Read More »

85

CORR
2008
Springer

125views Education» more CORR 2008»

Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

14 years 11 months ago

Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields

Download hal.archives-ouvertes.fr

We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...

Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy

claim paper

Read More »

« Prev « First page 7 / 41 Last » Next »