"Tight bounds for minimax grid matching wit applications to the average ..."

Tom Leighton, Peter W. Shor (1989)

> Home

Details and statistics

DOI: 10.1007/BF02124678

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/LeightonS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/LeightonS89
Tom Leighton, Peter W. Shor:
Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms. Comb. 9(2): 161-187 (1989)

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.