The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable |
scientific article |
Statements
The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (English)
0 references
5 May 1999
0 references
strong \({\mathcal P}\)-enumerability
0 references
computational complexity
0 references
