Fully Subexponential Time Approximation Scheme for Product Partition
Abstract: In this paper we study the Product Partition Problem (PPP), i.e. we are given a set of $n$ natural numbers represented on $m$ bits each and we are asked if a subset exists such that the product of the numbers in the subset equals the product of the numbers not in the subset. Our approach is to obtain the integer factorization of each number. This is the subexponential step. We then form a matrix with the exponents of the primes and propose a novel procedure which modifies the given numbers in such a way that their integer factorization contains sufficient primes to facilitate the search for the solution to the partition problem, while maintaining a similar product. We show that the required time and memory to run the proposed algorithm is subexponential.
- S. Nanda Subset Sum Problem https://www.cs.dartmouth.edu/~ac/Teach/CS105-Winter05/Notes/nanda-scribe-3.pdf
- K. Koiliaris, C. Xu A Faster Pseudopolynomial Time Algorithm for Subset Sum ACM Transactions on Algorithms, Volume 15, Issue 3 July 2019 Article No.: 40, pp 1–20
- K. Bringmann A near-linear pseudopolynomial time algorithm for subset sum In Klein, Philip N. (ed.). Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017). SIAM. pp. 1073–1084
- An efficient fully polynomial approximation scheme for the Subset-Sum Problem Journal of Computer and System Sciences 66 (2003) 349–370
- V. V. Curtis, C. A. Sanches, A low-space algorithm for the subset-sum problem on GPU Computers & Operations Research. 83: 120–124
- S. Sahni Computationally Related Problems SIAM J Comput, vol. 3, nr. 4, 1974
- B. T. Polyak Minimization Of Unsmooth Functionals Moscow 1968
- B. T Polyak A general method for solving extremal problems. DokE. Akad. Nauk SSSR. 174, 1, 33-36, 1967.
- B.T. Polyak Introduction to Optimization Optimization Software New York
- Proximal algorithms Foundations and Trends in Optimization 1 123–231, 2013
- S. Boyd Subgradient Methods Notes for EE364b, Stanford University, Spring 2013–14
- Linear Matrix Inequalities in System and Control Theory Society for Industrial and Applied Mathematics, 1994
- Quadratic optimization In: Handbook of global optimization, pp. 217-269. Springer, 1995
- R. G. Bland, D. Goldfarb and M. J. Todd The Ellipsoid Method: A Survey Cornell University, Ithaca, New York, 1981
- H. Bauschke, J. M. Borwein On Projection Algorithms for Solving Convex Feasibility Problems SIAM Review, 38(3), 1996.
- S. Bubeck Convex Optimization: Algorithms and Complexity Foundations and Trends in Machine Learning Vol. 8, No. 3-4 (2015) 231–357 Knapsack Problems Springer 2004, ISBN 978-3-540-24777-7
- Convex Optimization Cambridge University Press 2004
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.