"Constructibility of the Set of Polynomials with a Fixed Bernstein-Sato ..."

Anton Leykin (2001)

> Home

Details and statistics

DOI: 10.1006/JSCO.2001.0488

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jsc/Leykin01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/Leykin01
Anton Leykin:
Constructibility of the Set of Polynomials with a Fixed Bernstein-Sato Polynomial: an Algorithmic Approach. J. Symb. Comput. 32(6): 663-675 (2001)

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.