Theoremadvanced
Ben-Or's theorem
Also called Ben-Or lower bound, Milnor-Thom connected components bound.
The depth of an algebraic decision tree is Omega(log of the number of connected components of the accepted set).
The depth of an algebraic decision tree is Omega(log of the number of connected components of the accepted set).
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 2VZSMS Edit this page History Report an error