"Average-case complexity of the Euclidean algorithm with a fixed polynomial ..."

Nardo Giménez et al. (2022)

> Home

Details and statistics

DOI: 10.1017/S0963548321000274

access: closed

type: Journal Article

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/GimenezMPP22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/GimenezMPP22
Nardo Giménez, Guillermo Matera, Mariana Pérez, Melina Privitelli:
Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field. Comb. Probab. Comput. 31(1): 166-183 (2022)

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.