Author:
Hoberg Rebecca,Ramadas Harishchandra,Rothvoss Thomas,Yang Xin
Publisher
Springer International Publishing
Reference22 articles.
1. Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the 28th STOC, pp. 99–108. ACM (1996)
2. Aharonov, D., Regev, O.: Lattice problems in NP cap conp. J. ACM 52(5), 749–765 (2005)
3. Bohman, T.: A sum packing problem of erdös and the conway-guy sequence. Proc. AMS 124(12), 3627–3636 (1996)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1997)
5. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, vol. 2, pp. 122–125. Springer, Heidelberg (2012)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reductions in PPP;Information Processing Letters;2019-05
2. Equal-Subset-Sum Faster Than the Meet-in-the-Middle;LEIBNIZ INT PR INFOR;2019
3. PPP-Completeness with Connections to Cryptography;2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS);2018-10