Pages that link to "Item:Q1915805"

The following pages link to Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) (Q1915805):

Displaying 4 items.

• Efficient subspace approximation algorithms (Q664540) (← links)
• Fast subspace approximation via greedy least-squares (Q745854) (← links)
• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
• Lines tangent to $2n-2$ spheres in ${\mathbb R}^n$ (Q3151255) (← links)