A faster algorithm for pigeonhole equal sums
From MaRDI portal
Cites work
- A short note on Merlin-Arthur protocols for subset sum
- An upper bound for codes in a two-access binary erasure channel (Corresp.)
- Average-case subset balancing problems
- Classical and quantum algorithms for variants of subset-sum via dynamic programming
- Computing Partitions with Applications to the Knapsack Problem
- Dense subset sum may be the hardest
- Efficient sampling methods for discrete distributions
- Element distinctness, frequency moments, and sliding windows
- Equal-subset-sum faster than the meet-in-the-middle
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- Improved classical and quantum algorithms for subset-sum
- Improved Generic Algorithms for Hard Knapsacks
- Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors
- New generic algorithms for hard knapsacks
- On the complexity of the parity argument and other inefficient proofs of existence
- PPP-completeness with connections to cryptography
- Reductions in \textbf{PPP}
- Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
- Subset sum in the absence of concentration
- Subset sum in time \(2^{n/2}/\text{poly}(n)\)
- Time-space tradeoffs for element distinctness and set intersection via pseudorandomness
- Truly low-space element distinctness and subset sum via pseudorandom hash functions
Cited in
(1)- New algorithms for pigeonhole equal subset sum
This page was built for publication: A faster algorithm for pigeonhole equal sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875100)
