The following pages link to On convex complexity measures (Q964405):
Displaying 11 items.
- On the nonnegative rank of distance matrices (Q436566) (← links)
- An extension of Khrapchenko's theorem (Q753798) (← links)
- On the complexity of sums of Dirichlet measures (Q1210518) (← links)
- Complexity of convex optimization using geometry-based measures and a reference point (Q1434069) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- A probabilistic analysis of a measure of combinatorial complexity for the central curve (Q1970302) (← links)
- A refinement of Cauchy-Schwarz complexity (Q2674565) (← links)
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model (Q3169071) (← links)
- On the Complexity of Computing Two Nonlinearity Measures (Q4981157) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
