THE BOUNDED SUBSET SUM PROBLEM IS ALMOST EVERYWHERE RANDOMLY DECIDABLE IN O(N)

被引：1

|

作者：

TINHOFER, G

SCHRECK, H

机构：

来源：

INFORMATION PROCESSING LETTERS | 1986年 / 23卷 / 01期

关键词：

D O I：

10.1016/0020-0190(86)90123-7

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：11 / 17

页数：7

相关论文

共 8 条

[1] AN ALMOST LINEAR TIME ALGORITHM FOR THE DENSE SUBSET SUM PROBLEM
GALIL, Z
MARGALIT, O
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 719 - 727
[2] AN ALMOST LINEAR-TIME ALGORITHM FOR THE DENSE SUBSET-SUM PROBLEM
GALIL, Z
MARGALIT, O
[J]. SIAM JOURNAL ON COMPUTING, 1991, 20 (06) : 1157 - 1189
[3] On Non-Negative Elliptic-Type Differential Inequalities in ℝn, Vanishing Almost Everywhere on Some Open Subset in ℝn
N. O. Maksimova
[J]. Journal of Mathematical Sciences, 2004, 120 (3) : 1407 - 1410
[4] From Almost Everywhere to Everywhere: Byzantine Agreement with (O)over-tilde(n3/2) Bits
King, Valeire
Saia, Jared
[J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2009, 5805 : 464 - +
[5] O((log n)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems
Ding, Liang
Fu, Bin
Fu, Yunhui
Lu, Zaixin
Zhao, Zhiyu
[J]. FRONTIERS IN ALGORITHMICS, 2010, 6213 : 250 - +
[6] An O(m log n) algorithm for the max plus sum spanning tree problem
Punnen, AP
Nair, KPK
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 89 (02) : 423 - 426
[7] AN O(N-2) ALGORITHM FOR THE SATISFIABILITY PROBLEM OF A SUBSET OF PROPOSITIONAL SENTENCES IN CNF THAT INCLUDES ALL HORN SENTENCES
ARVIND, V
BISWAS, S
[J]. INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 67 - 69
[8] An O(1.414n) volume molecular solutions for the subset-product problem on DNA-based supercomputing
Pan Jun
Yao Fengjuan
Li Qinghua
[J]. PROCEEDINGS OF THE 2009 2ND INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS, VOLS 1-4, 2009, : 1572 - 1576