"On the complexity of computing Gröbner bases for zero dimensional ..."

Yagati N. Lakshman (1990)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2022-09-27

- view
  - electronic edition via handle.net
- export record
  dblp key:
  - phd/us/Lakshman90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/us/Lakshman90
Yagati N. Lakshman:
On the complexity of computing Gröbner bases for zero dimensional polynomial ideals. Rensselaer Polytechnic Institute, USA, 1990

a service of

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.