"What a fast FPU means for algorithms: A story of vector elementary functions."

Marat Dukhan (2013)

> Home

Details and statistics

DOI: 10.1109/HOTCHIPS.2013.7478327

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  - electronic edition @ ieeecomputersociety.org
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/hotchips/Dukhan13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hotchips/Dukhan13
Marat Dukhan:
What a fast FPU means for algorithms: A story of vector elementary functions. Hot Chips Symposium 2013: 1

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.