The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0925-7721(98)00021-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973868432 / rank | |||
Normal rank | |||
Latest revision as of 09:57, 30 July 2024
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
0 references
0 references
