Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a ..."

Michael Kaminski, Chaoping Xing (2013)

> Home

Details and statistics

DOI: 10.1109/TIT.2013.2272072

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/KaminskiX13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/KaminskiX13
Michael Kaminski, Chaoping Xing:
An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial. IEEE Trans. Inf. Theory 59(10): 6845-6850 (2013)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.