On the complexity of computing the diameter of a polytope (Q1337144): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Q228771 / rank | |||
Property / author | |||
Property / author: Alan M. Frieze / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01206636 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2010362899 / rank | |||
Normal rank |
Latest revision as of 09:36, 30 July 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