"Finding an o(n² log n) Algorithm Is Sometimes Hard."

Antonio Hernández-Barrera (1996)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ cccg.ca (open access)
- export record
  dblp key:
  - conf/cccg/Barrera96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/Barrera96
Antonio Hernández-Barrera:
Finding an o(n² log n) Algorithm Is Sometimes Hard. CCCG 1996: 289-294

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.