Recommendations
- Computational complexity of norm-maximization
- A Variable-Complexity Norm Maximization Problem
- Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
- N P-hardness of largest contained and smallest containing simplices for V- and H-polytopes
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 809154 (Why is no real title available?)
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- Computational complexity of norm-maximization
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- NP is as easy as detecting unique solutions
- On the complexity of unique solutions
- Some NP-complete problems in quadratic and nonlinear programming
- The complexity of optimization problems
Cited in
(8)- scientific article; zbMATH DE number 6704304 (Why is no real title available?)
- A Variable-Complexity Norm Maximization Problem
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- Largest \(j\)-simplices in \(n\)-polytopes
- Computational complexity of norm-maximization
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
- Polynomial norms
- On the complexity of some basic problems in computational convexity. I. Containment problems
This page was built for publication: Deciding uniqueness in norm maximazation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687086)
