A subset-sum inequality

被引：0
|
作者：
Stong, R [1 ]
机构：
[1] Rice Univ, Houston, TX 77251 USA
来源：
AMERICAN MATHEMATICAL MONTHLY | 2006年 / 113卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：269 / 270
页数：2
相关论文
共 50 条
  • [41] GPU implementation of a parallel two-list algorithm for the subset-sum problem
    Wan, Lanjun
    Li, Kenli
    Liu, Jing
    Li, Keqin
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2015, 27 (01): : 119 - 145
  • [42] Efficient CPU-GPU cooperative computing for solving the subset-sum problem
    Wan, Lanjun
    Li, Kenli
    Liu, Jing
    Li, Keqin
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2016, 28 (02): : 492 - 516
  • [43] NEW ANALYTICAL RESULTS IN SUBSET-SUM PROBLEM (VOL 114, PG 205, 1993)
    FREIMAN, GA
    DISCRETE MATHEMATICS, 1994, 126 (1-3) : 447 - 447
  • [44] A subset-sum type formulation of a two-agent single-machine scheduling problem
    Avolio, Matteo
    Fuduli, Antonio
    INFORMATION PROCESSING LETTERS, 2020, 155
  • [45] A NEW LINEAR-STORAGE, POLYNOMIAL-TIME APPROXIMATION SCHEME FOR THE SUBSET-SUM PROBLEM
    FISCHETTI, M
    DISCRETE APPLIED MATHEMATICS, 1990, 26 (01) : 61 - 77
  • [46] Security of Knapsack Cryptosystem Using Subset-Sum Decision Problem against Alternative-Solution Attack
    Murakami, Yasuyuki
    Sakai, Ryuichi
    PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), 2018, : 614 - 617
  • [47] WORST-CASE ANALYSIS OF GREEDY ALGORITHMS FOR THE UNBOUNDED KNAPSACK, SUBSET-SUM AND PARTITION PROBLEMS
    LAI, TC
    OPERATIONS RESEARCH LETTERS, 1993, 14 (04) : 215 - 220
  • [48] Efficient Parallelization of a Two-List Algorithm for the Subset-Sum Problem on a Hybrid CPU/GPU Cluster
    Kang, Letian
    Wan, Lanjun
    Li, Kenli
    2014 SIXTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING (PAAP), 2014, : 93 - 98
  • [49] A parallel Time/Processor tradeoff T.P=0(nlogM/M) for the subset-sum problem
    Chedid, FB
    PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, 2001, : 478 - 481
  • [50] On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
    Escudero, LF
    Martello, S
    Toth, P
    ANNALS OF OPERATIONS RESEARCH, 1998, 81 : 379 - 404
12345