Pigeonhole Equal Subset Sum in O ⃰ (2ⁿ/³)
Name
zhang-szhang88-meng-eecs-2024-thesis.pdf
Description
Thesis PDF
Size
470.94 KB
Format
Adobe PDF
Checksum (MD5)
17c911e5af96e2b7a0c13d62de65fd78
Author(s)
Zhang, Stan
Advisor(s)
Williams, Ryan
Date Issued
May 2024
Publisher
Massachusetts Institute of Technology
Abstract
Subset Sum is a well known NP-hard problem. In Subset Sum, we are given a set of n integers S = {a1,··· ,an} and a target integer t, and are asked to find a subset A ⊆ [n] such that [formula]. We study a variant of the Subset Sum problem, Pigeonhole Equal Subset Sum. In Pigeonhole Equal Subset Sum, we are given a set of n integers S ={a₁,··· , aₙ} with the additional restriction that [formula], and want to find two different subsets A,B ⊆ [n] such that [formula]. The naive algorithm where we enumerate over all subset sums and look for a match takes O∗(2ⁿ) time. Horowitz and Sahni improve this to O ⃰ (2ⁿ/²) using a classical meet in the middle algorithm [1]. Recently, Jin and Wu improved this further to [formula] [2]. In this paper, we build on Jin and Wu’s techniques to improve the runtime even further to O ⃰ (2ⁿ/³).
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Copyright retained by author(s)
Persistent DSpace Link
