Conceptintro
Computational tractability
The idea that an algorithm is efficient when its running time is polynomial in the input size, contrasted with brute-force search.
The idea that an algorithm is efficient when its running time is polynomial in the input size, contrasted with brute-force search.
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 NW4VDT Edit this page History Report an error