"On the Complexity of Polyhedral Separability."

Nimrod Megiddo (1988)

> Home

Details and statistics

DOI: 10.1007/BF02187916

access: open

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dcg/Megiddo88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/Megiddo88
Nimrod Megiddo:
On the Complexity of Polyhedral Separability. Discret. Comput. Geom. 3: 325-337 (1988)

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.