Extension complexity is a concept from combinatorial optimization and theoretical computer science that deals with the complexity of representing convex sets and polytopes in terms of linear programming. Specifically, it studies how the size of a linear description (usually in terms of the number of constraints in the linear program) needed to define a convex set or polynomial can vary based on the way the set is extended or represented.
New to topics? Read the docs here!