Theoremadvanced
Lenstra's theorem
Also called fixed-dimension integer programming is polynomial.
Integer programming with a fixed number of variables is solvable in polynomial time.
Integer programming with a fixed number of variables is solvable in polynomial 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 GTWN3A Edit this page History Report an error