"A Simple and Fast Algorithm for Computing the N-th Term of a ..."

Alin Bostan, Ryuhei Mori (2021)

> Home

Details and statistics

DOI: 10.1137/1.9781611976496.14

access: closed

type: Conference or Workshop Paper

metadata version: 2021-03-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sosa/BostanM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sosa/BostanM21
Alin Bostan, Ryuhei Mori:
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence. SOSA 2021: 118-132

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.