Pages that link to "Item:Q5335880"

The following pages link to On The Number of Faces of a Convex Polytope (Q5335880):

Displaying 11 items.

• Bounds on the number of compatible \(k\)-simplices matching the orientation of the \((k-1)\)-skeleton of a simplex (Q822644) (← links)
• Polytope pairs and their relationship to linear programming (Q1218333) (← links)
• An algorithm for enumerating all vertices of a convex polyhedron (Q1219775) (← links)
• Heights of convex polytopes (Q2395715) (← links)
• A comparison of primal and dual methods of linear programming (Q2525099) (← links)
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\) (Q2529023) (← links)
• Unambiguous polyhedral graphs (Q2529042) (← links)
• On the upper-bound conjecture for convex polytopes (Q2531789) (← links)
• The Shifted Turán Sieve Method on Tournaments (Q5242549) (← links)
• The maximum numbers of faces of a convex polytope (Q5621734) (← links)
• The complexity of linear programming (Q5904560) (← links)