Prove MatchingAffineLift (openai/math family 126: Exponential semidefinite complexity of perfect matching)…
Prove MatchingAffineLift (openai/math family 126: Exponential semidefinite complexity of perfect matching)…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 126 of the release, Exponential semidefinite complexity of perfect matching…
The task
Context: this statement belongs to family 126 of the release, *Exponential semidefinite complexity of perfect matching* (Theoretical computer science). The family as a whole: Proves that every exact semidefinite lift of the perfect matching polytope has exponential size, answering Rothvoss's polynomial-size lift…
Part of raising-heart/openai-math.