"A Parallel Algorithm for the Knapsack Problem with Memory/Processor ..."

Henry Ker-Chang Chang, Jonathan Jen-Rong Chen (1992)

> Home

Details and statistics

DOI: 10.1142/S0129053392000043

access: closed

type: Journal Article

metadata version: 2020-09-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijhsc/ChangC92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijhsc/ChangC92
Henry Ker-Chang Chang, Jonathan Jen-Rong Chen:
A Parallel Algorithm for the Knapsack Problem with Memory/Processor Tradeoff M²P = O(2^n/2). Int. J. High Speed Comput. 4(2): 109-120 (1992)

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.