Techniqueadvanced
Prune and search
Also called Megiddo's prune-and-search.
Repeatedly discards a constant fraction of the input while searching for an optimal solution.
Repeatedly discards a constant fraction of the input while searching for an optimal solution.
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 C2SGBR Edit this page History Report an error