arXiv (All)
open access
Simpler Algorithms for Knapsack, Subset Sum, and Min-Plus Convolution
We simplify algorithms for Knapsack, output-sensitive Subset Sum, and near-convex min-plus convolution. For bounded Knapsack, we give a deterministic algorithm using $O(N+W^2\log^3(W+2))$ arithmetic and comparison operations, where $W$ is the maximum item weight and $N$ counts input records with b
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Size-Sensitive Padded Decompositions for Faster Deterministic Negative-Weight Shortest Paths#1084376
- Dense Weak Hiding: Closing Complexity Gaps in Nonconvex and PL Finite-Sum Optimization under Individual Smoothness#1083184
- Exact (n + 1) Comparison Complexity for the N-Repeated Element Problem#987578
- Evaluating Top-K Sparsification and PowerSGD for Communication-Efficient Distributed Training#431808
- Official Review · NEURIPS 2024#787080
Record · ID 1141771
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive