"AN Omega(log n-k log k) TIME LINEAR COST LOWER BOUND FOR THE k FUNCTIONS ..."

Clive N. Galley (1996)

> Home

Details and statistics

DOI: 10.1142/S0129626496000194

access: closed

type: Journal Article

metadata version: 2020-03-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ppl/Galley96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ppl/Galley96
Clive N. Galley:
AN Omega(log n-k log k) TIME LINEAR COST LOWER BOUND FOR THE k FUNCTIONS COARSEST PARTITION PROBLEM. Parallel Process. Lett. 6(2): 195-202 (1996)

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.