2000 character limit reached
Extended Formulations for Polytopes of Regular Matroids
Published 31 Dec 2016 in cs.DM and math.CO | (1701.00538v2)
Abstract: We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.