7n/8) Time-Memory-Processor Tradeoff for Knapsack-Like Problems.">7n/8) Time-Memory-Processor Tradeoff for Knapsack-Like Problems., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Parallel O(n27n/8) Time-Memory-Processor Tradeoff for ..."

Kenli Li et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11577188_26

access: open

type: Conference or Workshop Paper

metadata version: 2020-10-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/npc/LiLLZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/npc/LiLLZ05
Kenli Li, Renfa Li, Lei Yang, Yantao Zhou:
A Parallel O(n2^7n/8) Time-Memory-Processor Tradeoff for Knapsack-Like Problems. NPC 2005: 197-204

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.