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, Chaoping Xing. An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial. IEEE Transactions on Information Theory, 59(10):6845-6850, 2013. [doi]
Abstract is missing.