"How Lower and Upper Complexity Bounds Meet in Elimination Theory."

Luis Miguel Pardo (1995)

> Home

Details and statistics

DOI: 10.1007/3-540-60114-7_4

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aaecc/Pardo95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaecc/Pardo95
Luis Miguel Pardo:
How Lower and Upper Complexity Bounds Meet in Elimination Theory. AAECC 1995: 33-69

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.