"The complexity of class polynomial computation via floating point ..."

Andreas Enge (2009)

> Home

Details and statistics

DOI: 10.1090/S0025-5718-08-02200-X

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/moc/Enge09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/moc/Enge09
Andreas Enge:
The complexity of class polynomial computation via floating point approximations. Math. Comput. 78(266): 1089-1107 (2009)

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.