"Comparing the speed of programs for sparse polynomial multiplication."

Richard J. Fateman (2003)

> Home

Details and statistics

DOI: 10.1145/844076.844080

access: closed

type: Journal Article

metadata version: 2020-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cca/Fateman03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cca/Fateman03
Richard J. Fateman:
Comparing the speed of programs for sparse polynomial multiplication. SIGSAM Bull. 37(1): 4-15 (2003)

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.