Pages that link to "Item:Q309640"
From MaRDI portal
The following pages link to The maximum number of faces of the Minkowski sum of two convex polytopes (Q309640):
Displaying 11 items.
- The maximum number of faces of the Minkowski sum of two convex polytopes (Q309640) (← links)
- Maximal f-vectors of Minkowski sums of large numbers of polytopes (Q411394) (← links)
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums (Q507686) (← links)
- A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes (Q728499) (← links)
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714) (← links)
- Log-Concavity and Lower Bounds for Arithmetic Circuits (Q2946406) (← links)
- (Q5111020) (← links)
- Almost Simplicial Polytopes: The Lower and Upper Bound Theorems (Q5222174) (← links)
- (Q5743374) (redirect page) (← links)
- Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums (Q5886829) (← links)
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q6126717) (← links)