Algorithm Search⌘K

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.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Statement
  • one source with a locator