"An alternative to Ben-Or's lower bound for the knapsack problem complexity."

Valentin E. Brimkov, Stefan S. Dantchev (2002)

> Home

Details and statistics

DOI: 10.1016/S0893-9659(01)00116-1

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/appml/BrimkovD02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/appml/BrimkovD02
Valentin E. Brimkov, Stefan S. Dantchev:
An alternative to Ben-Or's lower bound for the knapsack problem complexity. Appl. Math. Lett. 15(2): 187-191 (2002)

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.