Subset-sum dynamic programming and input length
For positive integers a₁,…,aₙ and target T≥0, D(i,t)=D(i−1,t) or [t≥aᵢ and D(i−1,t−aᵢ)], with D(0,0)=true and other initial states false.
Key knowledge
For positive integers a₁,…,aₙ and target T≥0, D(i,t)=D(i−1,t) or [t≥aᵢ and D(i−1,t−aᵢ)], with D(0,0)=true and other initial states false. Evaluation costs O(nT) bounded-cost state operations, which is pseudopolynomial because T is binary encoded.
Conditions and scope
- Each item may be used at most once; states use 0≤t≤T.
- O(nT) need not be polynomial in the input's bit length.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture 18 subset-sum recurrence, base cases, state count and encoding discussion.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-subset-sum-dynamic-programming
- Revision
- university-core.1
- Structured reference record
- University core expansion