Algorithmadvanced
Schroeppel-Shamir algorithm
Also called Schroeppel-Shamir, split-and-list subset sum.
Subset sum in O(2^(n/2)) time with only O(2^(n/4)) memory, using heaps to generate the sums in order.
Subset sum in O(2^(n/2)) time with only O(2^(n/4)) memory, using heaps to generate the sums in order.
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 9AEYS5 Edit this page History Report an error