Pages that link to "Item:Q757258"
From MaRDI portal
The following pages link to Computational complexity of norm-maximization (Q757258):
Displaying 16 items.
- On clustering bodies: geometry and polyhedral approximation (Q603849) (← links)
- Deciding uniqueness in norm maximazation (Q687086) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces (Q1182991) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem (Q1923163) (← links)
- On the co-NP-completeness of the zonotope containment problem (Q2068561) (← links)
- Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
- On the entropy of couplings (Q2346421) (← links)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077) (← links)
- Novel approaches to the discrimination problem (Q4031377) (← links)
- Deterministic and randomized polynomial‐time approximation of radii (Q4435530) (← links)
- Two Classes of Games on Polyhedral Sets in Systems Economic Studies (Q4562467) (← links)
- Distributionally Robust Linear and Discrete Optimization with Marginals (Q5095178) (← links)
- Gradient free cooperative seeking of a moving source (Q6103010) (← links)
