"An Omega(log n) time linear cost lower bound for the single function ..."

Clive N. Galley (1995)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-06-18

- no documents available
- export record
  dblp key:
  - journals/eatcs/Galley95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Galley95
Clive N. Galley:
An Omega(log n) time linear cost lower bound for the single function coarsest partition problem. Bull. EATCS 56 (1995)

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.