Theoremresearch
Sparsest cut UGC hardness
Also called Khot-Vishnoi sparsest cut hardness.
Under UGC, sparsest cut has no constant-factor approximation beyond the known bounds.
Under UGC, sparsest cut has no constant-factor approximation beyond the known bounds.
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 TMW3A6 Edit this page History Report an error