Techniqueadvanced
Sum over subsets (SOS) dynamic programming
Also called SOS DP.
Compute, for every mask, an aggregate over all its submasks in O(n 2^n) time.
Compute, for every mask, an aggregate over all its submasks in O(n 2^n) time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 5CEWMG Edit this page History Report an error