A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Michael Kaminski. A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. SIAM Journal on Computing, 34(4):960-992, 2005. [doi]

The following publications are possibly variants of this publication:

A Lower Bound on the Complexity of Polynomial Multiplication Over Finite FieldsMichael Kaminski. STACS 2005: 485-495 [doi]

Multiplicative complexity of polynomial multiplication over finite fieldsMichael Kaminski, Nader H. Bshouty. JACM, 36(1):150-170, 1989. [doi]

Complexity of Polynomial Multiplication over Finite FieldsMichael Kaminski. csr 2006: 2 [doi]

Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract)Michael Kaminski, Nader H. Bshouty. focs 1987: 138-140

Polynomial multiplication over finite fields: from quadratic to straight-line complexityNader H. Bshouty, Michael Kaminski. cc, 15(3):252-262, 2006. [doi]

Multiplication of Polynomials over Finite FieldsNader H. Bshouty, Michael Kaminski. SICOMP, 19(3):452-456, 1990.

A Lower Bound for Polynomial MultiplicationMichael Kaminski. TCS, 40:319-322, 1985.

runs on WebDSL