"On the complexity of the Lickteig-Roy subresultant algorithm."

Grégoire Lecerf (2019)

> Home

Details and statistics

DOI: 10.1016/J.JSC.2018.04.017

access: closed

type: Journal Article

metadata version: 2018-12-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jsc/Lecerf19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/Lecerf19
Grégoire Lecerf:
On the complexity of the Lickteig-Roy subresultant algorithm. J. Symb. Comput. 92: 243-268 (2019)

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.