Construct · 1 fields · 1 citations

extension complexity: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Combinatorial optimization

the smallest number of inequalities in any higher-dimensional linear description that projects onto a given polytope, tied to nonnegative rank.

In combinatorial optimization, extension complexity refers to the smallest number of inequalities in any higher-dimensional linear description that projects onto a given polytope, tied to nonnegative rank. This meaning comes from Yannakakis (1991) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how extension complexity sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructs extension3 fields · 3 citationsjingle · one word, three constructs number3 fields · 6 citationsjingle · one word, three constructs

References

Yannakakis, M. (1991). Expressing combinatorial optimization problems by Linear Programs. Journal of Computer and System Sciences, 43(3), 441-466. https://doi.org/10.1016/0022-0000(91)90024-y

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct