"Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm."

Rhonda Kay Gaede, M. Ray Mercer, Bill Underwood (1986)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2002-10-22

- no documents available
- export record
  dblp key:
  - conf/itc/GaedeMU86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itc/GaedeMU86
Rhonda Kay Gaede, M. Ray Mercer, Bill Underwood:
Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm. ITC 1986: 498-505

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.