- 期刊
A Note on One Protocol for Subset Sum Problem
摘要
In computer sciences the subset sum problem which is closely related to knapsack problem has many applications. Recently, Nederlof has presented a protocol [Information Processing Letters, 118 (2017), 15-16] for constructing a proof that the number of subsets summing to a particular integer equals a claimed quantity. In this note we show that the protocol is awed because: 1) its consistence is not kept; 2) the proposed recurrence formula is incorrect.
延伸閱讀
- Zheng, Y., Yan, Y., Liu, S., Huang, X., & Xu, W. (2012). An Efficient Approach to Solve the Large-Scale Semidefinite Programming Problems. Mathematical Problems in Engineering, 2012(), 556-567-533. https://doi.org/10.1155/2012/764760
- 鄭宇翔（2014）。On a variant of sum-product estimate〔碩士論文，國立中央大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0031-0412201511584367
- Tsou, H. Y. (2012). A Study on the Longest Common Increasing Subsequence Problem [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-2002201315385648
- Wu, J. S. (2013). An Improved Algorithm for the Longest Common Subsequence Problem [master's thesis, National Chi Nan University]. Airiti Library. https://doi.org/10.6837/NCNU.2013.00014
- Sung, C. C. (2007). Efficient Algorithms for some Heaviest Subsequence Problems [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2007.00099