Generalization of the Subset Sum Problem and Cubic Forms

被引：0

作者：

A. V. Seliverstov

机构：

[1] Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute),

来源：

Computational Mathematics and Mathematical Physics | 2023年 / 63卷

关键词：

integer programming; linear equation system; sum of subsets; average-case complexity;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：48 / 56

页数：8

共 61 条

[1]

Horowitz E.(1974)Computing partitions with applications to the knapsack problem J. ACM 21 277-292

[2]

Sahni S.(1992)A note on a J. Complexity 8 451-453

[3]

Meer K.(1994)Computing over the reals with addition and order Theor. Comput. Sci. 133 35-47

[4]

Koiran P.(1996)On digital nondeterminism Math. Syst. Theory 29 635-647

[5]

Cucker F.(2001)Complexity of Positivstellensatz proofs for the knapsack Comput. Complexity 10 139-154

[6]

Matamala M.(2015)On the complexity of Hilbert refutations for partition J. Symb. Comput. 66 70-83

[7]

Grigoriev D.(2019)Faster pseudopolynomial time algorithms for subset sum ACM Trans. Algorithms 15 40-246

[8]

Margulies S.(1985)Solving low-density subset sum problems J. ACM 32 229-128

[9]

Onn S.(1992)Improved low-density subset sum algorithms Comput. Complexity 2 111-187

[10]

Pasechnik D. V.(2020)Solving subset sum with small space—Handling cryptanalytic Big Data Inf. Technol. 62 181-48