FACTORING POLYNOMIALS OVER LARGE FINITE FIELDS

被引：267

作者：

BERLEKAMP, ER

机构：

来源：

关键词：

D O I：

10.1090/s0025-5718-1970-0276200-x

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：713 / +

页数：1

共 21 条

[1]

BERLEKAM.ER, 1967, AT&T TECH J, V46, P1853

[2] ON SOLUTION OF ALGEBRAIC EQUATIONS OVER FINITE FIELDS [J].

BERLEKAM.ER ;

RUMSEY, H ;

SOLOMON, G .

INFORMATION AND CONTROL, 1967, 10 (06) :553-&

[3]

Berlekamp E. R., 1968, ALGEBRAIC CODING THE

[4]

BERLEKAMP ER, 1965, SURVEY MODERN ALGEBR

[5] ON THE IRREDUCIBILITY OF CERTAIN POLYNOMIALS [J].

BRAUER, A ;

EHRLICH, G .

[6] AN IRREDUCIBILITY CRITERION FOR POLYNOMIALS OVER INTEGERS [J].

BROWN, WS ;

GRAHAM, RL .

[7]

Burgess DA., 1962, P LOND MATH SOC, V3, P179, DOI 10.1112/plms/s3-12.1.179

[8] COMPUTING MULTIPLICATIVE INVERSES IN GF(P) [J].

COLLINS, GE .

[9]

COLLINS GE, 1967, UNPUBLISHED COMMUNIC

[10]

Gautschi W., 1963, NUMER MATH, V5, P425