Pages that link to "Item:Q1337144"
From MaRDI portal
The following pages link to On the complexity of computing the diameter of a polytope (Q1337144):
Displaying 6 items.
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) (Q1915805) (← links)
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres (Q2197688) (← links)
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)