"Complexity bounds for the rational Newton-Puiseux algorithm over finite ..."

Adrien Poteaux, Marc Rybowicz (2011)

> Home

Details and statistics

DOI: 10.1007/S00200-011-0144-6

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/aaecc/PoteauxR11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aaecc/PoteauxR11
Adrien Poteaux, Marc Rybowicz:
Complexity bounds for the rational Newton-Puiseux algorithm over finite fields. Appl. Algebra Eng. Commun. Comput. 22(3): 187-217 (2011)

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.