Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2026
|
| Online Access: | https://doi.org/10.5281/zenodo.18374114 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- <p>This paper presents a deterministic, polynomial-time algorithm (Hierarchical Carry Reduction: HCR) for the Subset Sum Problem, a classic NP-complete problem. By mapping integer sets into a vector space and analyzing carry transitions across hierarchical layers, we demonstrate that the number of active states is strictly bounded by O(n).</p>