The following pages link to (Q4401017):
Displaying 7 items.
- Numerical decomposition of a convex function (Q799479) (← links)
- Computing the Ehrhart polynomial of a convex lattice polytope (Q1330880) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
- The computational complexity of duality (Q2832893) (← links)
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy (Q6642430) (← links)
- The best ways to slice a polytope (Q6657200) (← links)