Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.04465 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
An Improved Pseudopolynomial Time Algorithm for Subset Sum
by: Chen, Lin, et al.
Published: (2024)
by: Chen, Lin, et al.
Published: (2024)
Derandomizing Pseudopolynomial Algorithms for Subset Sum
by: Chan, Timothy M.
Published: (2026)
by: Chan, Timothy M.
Published: (2026)
Approximate Min-Sum Subset Convolution
by: Stoian, Mihail
Published: (2024)
by: Stoian, Mihail
Published: (2024)
Beating Bellman's Algorithm for Subset Sum
by: Bringmann, Karl, et al.
Published: (2024)
by: Bringmann, Karl, et al.
Published: (2024)
Subset Balancing and Generalized Subset Sum via Lattices
by: Gao, Yiming, et al.
Published: (2026)
by: Gao, Yiming, et al.
Published: (2026)
Sumsets, 3SUM, Subset Sum: Now for Real!
by: Fischer, Nick
Published: (2024)
by: Fischer, Nick
Published: (2024)
Improved Space Bounds for Subset Sum
by: Belova, Tatiana, et al.
Published: (2024)
by: Belova, Tatiana, et al.
Published: (2024)
An Almost Quadratic Vertex Kernel for Subset Feedback Arc Set in Tournaments
by: Bai, Tian
Published: (2025)
by: Bai, Tian
Published: (2025)
Does Subset Sum Admit Short Proofs?
by: Włodarczyk, Michał
Published: (2024)
by: Włodarczyk, Michał
Published: (2024)
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
by: Aggarwal, Divesh, et al.
Published: (2024)
by: Aggarwal, Divesh, et al.
Published: (2024)
Subset Sum in Near-Linear Pseudopolynomial Time and Polynomial Space
by: Sajith, Thejas Radhika
Published: (2025)
by: Sajith, Thejas Radhika
Published: (2025)
Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
by: Chen, Lin, et al.
Published: (2025)
by: Chen, Lin, et al.
Published: (2025)
Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
by: Joux, Antoine, et al.
Published: (2024)
by: Joux, Antoine, et al.
Published: (2024)
Learning Dependency Models for Subset Repair
by: Li, Haoda, et al.
Published: (2025)
by: Li, Haoda, et al.
Published: (2025)
A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
by: Jana, Satyabrata, et al.
Published: (2025)
by: Jana, Satyabrata, et al.
Published: (2025)
Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
by: Kanellopoulos, Sotiris, et al.
Published: (2025)
by: Kanellopoulos, Sotiris, et al.
Published: (2025)
Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs
by: Kothari, Pravesh, et al.
Published: (2024)
by: Kothari, Pravesh, et al.
Published: (2024)
On Sketching Quadratic Forms
by: Andoni, Alexandr, et al.
Published: (2015)
by: Andoni, Alexandr, et al.
Published: (2015)
Online Rounding for Set Cover under Subset Arrivals
by: Byrka, Jarosław, et al.
Published: (2025)
by: Byrka, Jarosław, et al.
Published: (2025)
Efficient Unitary T-designs from Random Sums
by: Chen, Chi-Fang, et al.
Published: (2024)
by: Chen, Chi-Fang, et al.
Published: (2024)
Optimal Dynamic Parameterized Subset Sampling
by: Gan, Junhao, et al.
Published: (2024)
by: Gan, Junhao, et al.
Published: (2024)
A Nearly Quadratic-Time FPTAS for Knapsack
by: Chen, Lin, et al.
Published: (2023)
by: Chen, Lin, et al.
Published: (2023)
Subset-lex: did we miss an order?
by: Arndt, Jörg
Published: (2014)
by: Arndt, Jörg
Published: (2014)
Did Fourier Really Meet Möbius? Fast Subset Convolution via FFT
by: Stoian, Mihail
Published: (2024)
by: Stoian, Mihail
Published: (2024)
Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
by: Bai, Tian, et al.
Published: (2022)
by: Bai, Tian, et al.
Published: (2022)
Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
by: Nezhad, Sina Bagheri, et al.
Published: (2025)
by: Nezhad, Sina Bagheri, et al.
Published: (2025)
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
by: Kobayashi, Yasuaki, et al.
Published: (2020)
by: Kobayashi, Yasuaki, et al.
Published: (2020)
Distribution Testing Meets Sum Estimation
by: Pradhan, Pinki, et al.
Published: (2025)
by: Pradhan, Pinki, et al.
Published: (2025)
FPT Approximation for Capacitated Sum of Radii
by: Jaiswal, Ragesh, et al.
Published: (2024)
by: Jaiswal, Ragesh, et al.
Published: (2024)
Sparsifying Sums of Positive Semidefinite Matrices
by: Basu, Arpon, et al.
Published: (2025)
by: Basu, Arpon, et al.
Published: (2025)
Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)
by: Black, Hadley, et al.
Published: (2024)
Certificate-Sensitive Subset Sum: Realizing Instance Complexity
by: Salas, Jesus
Published: (2025)
by: Salas, Jesus
Published: (2025)
All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
by: Anand, Aditya, et al.
Published: (2025)
by: Anand, Aditya, et al.
Published: (2025)
On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
by: Gadekar, Ameet
Published: (2026)
by: Gadekar, Ameet
Published: (2026)
Min-Sum Set Cover on Parallel Machines
by: Szyfelbein, Michał
Published: (2026)
by: Szyfelbein, Michał
Published: (2026)
Sum Estimation via Vector Similarity Search
by: Mussmann, Stephen, et al.
Published: (2026)
by: Mussmann, Stephen, et al.
Published: (2026)
FPT approximations for Capacitated Sum of Radii and Diameters
by: Filtser, Arnold, et al.
Published: (2024)
by: Filtser, Arnold, et al.
Published: (2024)
Parameterized Algorithms for Minimum Sum Vertex Cover
by: Aute, Shubhada, et al.
Published: (2024)
by: Aute, Shubhada, et al.
Published: (2024)
Sum-of-Max Chain Partition of a Tree
by: Luo, Ruixi, et al.
Published: (2025)
by: Luo, Ruixi, et al.
Published: (2025)
A Faster Algorithm for Pigeonhole Equal Sums
by: Jin, Ce, et al.
Published: (2024)
by: Jin, Ce, et al.
Published: (2024)