Solving low-density multiple subset sum problems with SVP oracle

doi:10.1007/s11424-015-3324-9

CSpace > 系统科学研究所

	Solving low-density multiple subset sum problems with SVP oracle
	Pan Yanbin; Zhang Feng
	2016-02-01
Source Publication	JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
ISSN	1009-6124
Volume	29 Issue:1 Pages:228-242
Abstract	It is well known that almost all subset sum problems with density less than 0.9408 center dot center dot center dot can be solved in polynomial time with an SVP oracle that can find a shortest vector in a special lattice. In this paper, the authors show that a similar result holds for the k-multiple subset sum problem which has k subset sum problems with exactly the same solution. Specially, for the single subset sum problem (k = 1), a modified lattice is introduced to make the proposed analysis much simpler and the bound for the success probability tighter than before. Moreover, some extended versions of the multiple subset sum problem are also considered.
Keyword	Lattice low-density multiple modular subset sum problem multiple subset sum problem
DOI	10.1007/s11424-015-3324-9
Language	英语
Funding Project	National Natural Science Foundation of China[11201458] ; National Natural Science Foundation of China[11471314] ; 973 Project[2011CB302401] ; National Center for Mathematics and Interdisciplinary Sciences, Chinese Academy of Sciences
WOS Research Area	Mathematics
WOS Subject	Mathematics, Interdisciplinary Applications
WOS ID	WOS:000370162300014
Publisher	SPRINGER HEIDELBERG
Citation statistics	Cited Times:1[WOS] [WOS Record] [Related Records in WOS]
Document Type	期刊论文
Identifier	http://ir.amss.ac.cn/handle/2S8OKBNM/22035
Collection	系统科学研究所
Affiliation	Chinese Acad Sci, Acad Math & Syst Sci, NCMIS, Key Lab Math Mechanizat, Beijing 100190, Peoples R China
Recommended Citation GB/T 7714	Pan Yanbin,Zhang Feng. Solving low-density multiple subset sum problems with SVP oracle[J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,2016,29(1):228-242.
APA	Pan Yanbin,&Zhang Feng.(2016).Solving low-density multiple subset sum problems with SVP oracle.JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,29(1),228-242.
MLA	Pan Yanbin,et al."Solving low-density multiple subset sum problems with SVP oracle".JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 29.1(2016):228-242.

Files in This Item:
There are no files associated with this item.

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh

中国科学院数学与系统科学研究院机构知识库