Faster space-efficient algorithms for subset sum and k-sum

Author:

Bansal Nikhil1,Garg Shashwat1,Nederlof Jesper1,Vyas Nikhil2

Affiliation:

1. Eindhoven University of Technology, Netherlands

2. IIT Bombay, India

Funder

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

European Research Council

Publisher

ACM

Reference52 articles.

1. Miklós Ajtai. 2005. Miklós Ajtai. 2005.

2. A Non-linear Time Lower Bound for Boolean Branching Programs. Theory of Computing 1 8 (2005) 149–176. DOI:https:// A Non-linear Time Lower Bound for Boolean Branching Programs. Theory of Computing 1 8 (2005) 149–176. DOI:https://

3. Sanjeev Arora and Boaz Barak. 2009. Sanjeev Arora and Boaz Barak. 2009.

4. Computational Complexity - A Modern Approach. Cambridge University Press. http://www.cambridge.org/catalogue/ catalogue.asp?isbn=9780521424264 Computational Complexity - A Modern Approach. Cambridge University Press. http://www.cambridge.org/catalogue/ catalogue.asp?isbn=9780521424264

5. Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm

Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Simple and Efficient Attack on the Merkle-Hellman Knapsack Cryptosystem;2024-02-05

2. The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems;ACM Transactions on Computation Theory;2022-03-31

3. SETH-based Lower Bounds for Subset Sum and Bicriteria Path;ACM Transactions on Algorithms;2022-01-23

4. Top--convolution and the quest for near-linear output-sensitive subset sum;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06

5. Low Weight Discrete Logarithm and Subset Sum in $$2^{0.65n}$$ with Polynomial Memory;Advances in Cryptology – EUROCRYPT 2020;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3