Computational complexity of norm-maximization
From MaRDI portal
Publication:757258
DOI10.1007/BF02123011zbMath0722.90080WikidataQ59568056 ScholiaQ59568056MaRDI QIDQ757258
Hans L. Bodlaender, Jan van Leeuwen, Peter Gritzmann, Victor Klee
Publication date: 1990
Published in: Combinatorica (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Deterministic and randomized polynomial‐time approximation of radii, Deciding uniqueness in norm maximazation, Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces, On the complexity of some basic problems in computational convexity. I. Containment problems, Largest \(j\)-simplices in \(n\)-polytopes, Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem, Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces, Novel approaches to the discrimination problem