Imagen de Portada

Geometry Of The Subset Sum Problem -- Part I

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Bollepalli, Srinivas Balaji
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Lower Bounds for Subset Sum in Resolution with Modular Counting
por: Part, Fedor
Publicado: (2022)

Subset Balancing and Generalized Subset Sum via Lattices
por: Gao, Yiming, et al.
Publicado: (2026)

Optimization of a Quantum Subset Sum Oracle
por: Benoit, Angelo, et al.
Publicado: (2024)

Improved Space Bounds for Subset Sum
por: Belova, Tatiana, et al.
Publicado: (2024)

A Subexponential Reduction from Product Partition to Subset Sum
por: Costandin, Marius
Publicado: (2024)

Algorithmic Structure in Subset Sum: Deterministic In-Bound Navigation and the Counting Complexity Divide
por: Nkosi, Thami
Publicado: (2025)

Does Subset Sum Admit Short Proofs?
por: Włodarczyk, Michał
Publicado: (2024)

Subset Sum in Near-Linear Pseudopolynomial Time and Polynomial Space
por: Sajith, Thejas Radhika
Publicado: (2025)

Certificate-Sensitive Subset Sum: Realizing Instance Complexity
por: Salas, Jesus
Publicado: (2025)

Minimum Selective Subset on Some Graph Classes
por: Manna, Bubai
Publicado: (2025)

New Direct Sum Tests
por: Westover, Alek, et al.
Publicado: (2024)

Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
por: Manna, Bubai
Publicado: (2025)

A Compendium of Subset Search Problems and Reductions relating to the Parsimonious Property
por: Bartlett, Celina Janet
Publicado: (2025)

The Algebraic Cost of a Boolean Sum
por: Orzel, Ian, et al.
Publicado: (2025)

IPS Lower Bounds for Formulas and Sum of ROABPs
por: Chatterjee, Prerona, et al.
Publicado: (2025)

Undecidability of Polynomial Inequalities in Subset Densities and Additive Energies
por: Li, Yaqiao
Publicado: (2025)

On the Bit Size of Sum-of-Squares Proofs for Symmetric Formulations
por: Bortolotti, Alex, et al.
Publicado: (2025)

Spectral Certificates and Sum-of-Squares Lower Bounds for Semirandom Hamiltonians
por: Kocurek, Nicholas
Publicado: (2025)

A Strong Direct Sum Theorem for Distributional Query Complexity
por: Blanc, Guy, et al.
Publicado: (2024)

On Saxe's theorems about the complexity of the Distance Geometry Problem
por: Kupperschmitt, Maël, et al.
Publicado: (2025)

Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity
por: Mackenzie, Simon, et al.
Publicado: (2024)

Multiquadratic Sum-of-Squares Lower Bounds Imply VNC$^1$ $\neq$ VNP
por: Rossman, Benjamin, et al.
Publicado: (2025)

Geometry Matters in Planar Storyplans
por: Dobler, Alexander, et al.
Publicado: (2025)

Pseudorandom and Pseudoentangled States from Subset States
por: Jeronimo, Fernando Granha, et al.
Publicado: (2023)

On the Degree Automatability of Sum-of-Squares Proofs
por: Bortolotti, Alex, et al.
Publicado: (2025)

A parametric version of the Hilbert Nullstellensatz
por: Manssour, Rida Ait El, et al.
Publicado: (2024)

On Computability of Computable Problems
por: Khaliq, Asad
Publicado: (2023)

The Stochastic Arrival Problem
por: Webster, Thomas
Publicado: (2022)

On the Parameterized Complexity of Min-Sum-Radii
por: Kumar, Pankaj, et al.
Publicado: (2026)

On the Hardness of the Drone Delivery Problem
por: Bartlmae, Simon, et al.
Publicado: (2025)

The Greedy Coin Change Problem
por: Gupta, Shreya, et al.
Publicado: (2024)

Continuous Defensive Domination Problems
por: Grüne, Christoph, et al.
Publicado: (2026)

Reductions Between Code Equivalence Problems
por: Cheraghchi, Mahdi, et al.
Publicado: (2025)

Total Search Problems in $\mathsf{ZPP}$
por: Fleming, Noah, et al.
Publicado: (2025)

Inverse Intersections for Boolean Satisfiability Problems
por: Homer, Paul W.
Publicado: (2025)

Parameterized Complexity of the Star Decomposition Problem
por: Hajebi, Sahab, et al.
Publicado: (2024)

On the Complexity of Problems on Tree-structured Graphs
por: Bodlaender, Hans L., et al.
Publicado: (2022)

The 2-Attractor Problem is NP-Complete
por: Fuchs, Janosch, et al.
Publicado: (2023)

On the Exact Matching Problem in Dense Graphs
por: Maalouly, Nicolas El, et al.
Publicado: (2024)

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all $\ell_p$ Norms
por: Bennett, Huck, et al.
Publicado: (2022)