Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Michael Kaminski. A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. SIAM Journal on Computing, 34(4):960-992, 2005. [doi]
No references recorded for this publication.
No citations of this publication recorded.