"Polynomial Complexity of the Newton-Puiseux Algorithm."

Alexander L. Chistov (1986)

> Home

Details and statistics

DOI: 10.1007/BFB0016248

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/Chistov86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/Chistov86
Alexander L. Chistov:
Polynomial Complexity of the Newton-Puiseux Algorithm. MFCS 1986: 247-255

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.