Approximating Multidimensional Subset Sum and Minkowski Decomposition of Polygons-Reference-Cited by-同舟云学术

Approximating Multidimensional Subset Sum and Minkowski Decomposition of Polygons

Published:2017-03 Issue:1 Volume:11 Page:35-48
ISSN:1661-8270
Container-title:Mathematics in Computer Science
language:en
Short-container-title:Math.Comput.Sci.

Author:

Emiris Ioannis Z.,Karasoulou Anna,Tzovas Charilaos

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s11786-017-0297-1.pdf

Reference22 articles.

1. Abu-Salem, F., Gao, S., Lauder, A.G.B.: Factoring polynomials via polytopes. In: Proceedings of ACM Internernational Symposium on Symbolic and Algebraic Computation, po. 4–11 (2004)

2. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54, 317–331 (1997)

3. Bellare, M., Goldwasser, S., Lund, C., Russell, A.: Efficient probabilistically checkable proofs and applications to approximations. In: Proceedings of ACM STOC, pp. 294–304. ACM (1993)

4. Bringmann, K.: A near-linear pseudopolynomial time algorithm for subset sum. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, USA, pp. 1073–1084. SIAM (2017)

5. Carothers, N.L.: Real Analysis. Cambridge Books Online. Cambridge University Press, Cambridge (2000)

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

1. Self-Masking for Hardening Inversions1;2023

2. On the Privacy of Federated Pipelines;Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval;2021-07-11