Pages that link to "Item:Q687086"
From MaRDI portal
The following pages link to Deciding uniqueness in norm maximazation (Q687086):
Displaying 6 items.
- Computational complexity of norm-maximization (Q757258) (← 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)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- (Q2974994) (← links)