"An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal ..."

Lars Langemyr (1990)

> Home

Details and statistics

DOI: 10.1007/3-540-54195-0_53

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aaecc/Langemyr90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaecc/Langemyr90
Lars Langemyr:
An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field. AAECC 1990: 222-233

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.