On the complexity of computing the diameter of a polytope (Q1337144): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A quasi-polynomial bound for the diameter\\of graphs of polyhedra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polytope pairs and their relationship to linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3320130 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths on Polytopes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of facets (and some facets of complexity) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The polynomial-time hierarchy / rank | |||
Normal rank | |||
Revision as of 09:04, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing the diameter of a polytope |
scientific article |
Statements
On the complexity of computing the diameter of a polytope (English)
0 references
30 October 1994
0 references
combinatorial diameter of a polytope
0 references
