On the Bounds of the Bilinear Complexity of Multiplication in Some Finite Fields

ISSN： 0938-1279

Source： Applicable Algebra in Engineering, Communication and Computing, Vol.15, Iss.3-4, 2004-11, pp. : 205-221

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Polynomial multiplication over finite fields: from quadratic to straight-line complexity

By Bshouty Nader Kaminski Michael

computational complexity, Vol. 15, Iss. 3, 2006-10 ,pp. : 252-262

Springer Publishing Company

Access to resources Recommend Favorite

Some Systems of Diagonal Equations over Finite Fields

By Moreno J.O.

Finite Fields and Their Applications, Vol. 4, Iss. 1, 1998-01 ,pp. : 29-37

Academic Press

Access to resources Recommend Favorite

Some explicit upper bounds for residues of zeta functions of number fields taking into account the behavior of the prime 2

By Louboutin Stéphane

manuscripta mathematica, Vol. 125, Iss. 1, 2008-01 ,pp. : 43-67

Springer Publishing Company

Access to resources Recommend Favorite

Propositional lower bounds: Algorithms and complexity

By Cadoli M.

Annals of Mathematics and Artificial Intelligence, Vol. 27, Iss. 1-4, 1999-01 ,pp. : 129-148

Springer Publishing Company

Access to resources Recommend Favorite

On Some Properties of Bilinear Maps of Order Bounded Variation

By Boulabiar Karim Buskes Gerard Page Robert

Positivity, Vol. 9, Iss. 3, 2005-09 ,pp. : 401-414

Springer Publishing Company

Access to resources Recommend Favorite