"Lower time bounds for parallel solving of the subset sum problem by a ..."

Roman Kolpakov, Mikhail Posypkin (2024)

> Home

Details and statistics

DOI: 10.1002/CPE.8144

access: closed

type: Journal Article

metadata version: 2024-08-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/concurrency/KolpakovP24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/KolpakovP24
Roman Kolpakov, Mikhail Posypkin:
Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm. Concurr. Comput. Pract. Exp. 36(18) (2024)

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.