A Probabilistic Approach to The Perfect Sum Problem

02/21/2022
by   Kristof Pusztai, et al.
0

The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of O(2^0.3113n). A modified version of this problem is known as the perfect sum problem and extends the subset sum idea further. This extension results in additional complexity, making it difficult to compute for a large input. In this paper, I propose a probabilistic approach which approximates the solution to the perfect sum problem by approximating the distribution of potential sums. Since this problem is an extension of the subset sum, our approximation also grants some probabilistic insight into the solution for the subset sum problem. We harness distributional approximations to model the number of subsets which sum to a certain size. These distributional approximations are formulated in two ways: using bounds to justify normal approximation, and approximating the empirical distribution via density estimation. These approximations can be computed in O(n) complexity, and can increase in accuracy with the size of the input data making it useful for large-scale combinatorial problems. Code is available at https://github.com/KristofPusztai/PerfectSum.

READ FULL TEXT

page 6

page 10

research
12/28/2019

Approximating Subset Sum is equivalent to Min-Plus-Convolution

Approximating Subset Sum is a classic and fundamental problem in compute...
research
12/08/2021

Faster Algorithms for k-Subset Sum and Variations

We present new, faster pseudopolynomial time algorithms for the k-Subset...
research
01/11/2022

Approximating Subset Sum Ratio via Subset Sum Computations

We present a new FPTAS for the Subset Sum Ratio problem, which, given a ...
research
04/06/2018

Subquadratic Approximation Scheme for Partition

The subject of this paper is the time complexity of approximating Knapsa...
research
05/19/2023

AutoCoreset: An Automatic Practical Coreset Construction Framework

A coreset is a tiny weighted subset of an input set, that closely resemb...
research
05/09/2021

Knapsack and Subset Sum with Small Items

Knapsack and Subset Sum are fundamental NP-hard problems in combinatoria...
research
06/04/2020

On subset sum problem in branch groups

We consider a group-theoretic analogue of the classic subset sum problem...

Please sign up or login with your details

Forgot password? Click here to reset