Sciweavers

Share
CSR   2006 International Computer Science Symposium
Wall of Fame | Most Viewed CSR-2006 Paper
CSR
2006
Springer
12 years 5 months ago
Complexity of Polynomial Multiplication over Finite Fields
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
Michael Kaminski
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source169
2Download preprint from source163
3Download preprint from source158
4Download preprint from source149
5Download preprint from source140
6Download preprint from source121
7Download preprint from source108
8Download preprint from source104
9Download preprint from source104
10Download preprint from source98
11Download preprint from source92
12Download preprint from source90
13Download preprint from source84
14Download preprint from source84
15Download preprint from source81
16Download preprint from source80
17Download preprint from source80
18Download preprint from source79
19Download preprint from source77
20Download preprint from source76
21Download preprint from source73
22Download preprint from source71
23Download preprint from source70
24Download preprint from source68
books