A Faster Algorithm for Pigeonhole Equal Sums
arxiv(2024)
摘要
An important area of research in exact algorithms is to solve Subset-Sum-type
problems faster than meet-in-middle. In this paper we study Pigeonhole Equal
Sums, a total search problem proposed by Papadimitriou (1994): given n
positive integers w_1,…,w_n of total sum ∑_i=1^n w_i < 2^n-1, the
task is to find two distinct subsets A, B ⊆ [n] such that ∑_i∈
Aw_i=∑_i∈ Bw_i.
Similar to the status of the Subset Sum problem, the best known algorithm for
Pigeonhole Equal Sums runs in O^*(2^n/2) time, via either meet-in-middle or
dynamic programming (Allcock, Hamoudi, Joux, Klingelhöfer, and Santha,
2022).
Our main result is an improved algorithm for Pigeonhole Equal Sums in
O^*(2^0.4n) time. We also give a polynomial-space algorithm in
O^*(2^0.75n) time. Unlike many previous works in this area, our approach
does not use the representation method, but rather exploits a simple structural
characterization of input instances with few solutions.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要