OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Extension complexity

 Home Mathematics Fields of mathematics Combinatorics Polyhedral combinatorics
 0 By others on same topic  0 Discussions  1970-01-01  See my version
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.

 Ancestors (5)

  1. Polyhedral combinatorics
  2. Combinatorics
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook