Pages that link to "Item:Q1337144"

The following pages link to On the complexity of computing the diameter of a polytope (Q1337144):

Displaying 3 items.

• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
• Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
• Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)