Extension complexity
id:
extension-complexity-218-783333
title:
Extension complexity
text:
In convex geometry and polyhedral combinatorics, the extension complexity of a convex polytope P is the smallest number of facets among convex polytopes Q that have P as a projection. In this context, Q is called an extended formulation of P ; it may have much higher dimension than P. The extension complexity depends on the precise shape of P, not just on its combinatorial structure. For instance, regular polygons with n sides have extension complexity O, but some other convex n
-gons have exten
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Extension_complexity
date created:
2021-09-04T07:12:46Z
date modified:
2024-09-13T03:51:03Z
main entity:
{"identifier":"Q5421948","url":"https://www.wikidata.org/entity/Q5421948"}
image:
fields total:
13
integrity:
14