Prove UniformSparsestCut (openai/math family 117: Uniform sparsest cut: hardness and semidefinite gaps) in…
Prove UniformSparsestCut (openai/math family 117: Uniform sparsest cut: hardness and semidefinite gaps) in…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 117 of the release, Uniform sparsest cut: hardness and semidefinite gaps…
The task
Context: this statement belongs to family 117 of the release, *Uniform sparsest cut: hardness and semidefinite gaps* (Theoretical computer science). The family as a whole: Proves that approximating Uniform Sparsest Cut within any fixed constant factor is NP-hard, even with nonnegative rational capacities and unit…
Part of raising-heart/openai-math.