Theoremadvanced
Freuder's theorem
Also called width theorem for CSP.
A CSP that is strongly k-consistent and has width less than k can be solved without backtracking.
A CSP that is strongly k-consistent and has width less than k can be solved without backtracking.
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 Q1W800 Edit this page History Report an error