Computational complexity of norm-maximization

This publication has 24 references indexed in Scilit:

• On the 0–1-Maximization of Positive Definite Quadratic Forms
  Operations Research Proceedings, 1989
• Unimodular functions
  Discrete Applied Mathematics, 1986
• A solvable case of quadratic 0–1 programming
  Discrete Applied Mathematics, 1986
• On the complexity of four polyhedral set containment problems
  Mathematical Programming, 1985
• The Complexity of Vertex Enumeration Methods
  Mathematics of Operations Research, 1983
• Quasimonotone Boolean Functions and Bistellar Graphs
  Published by Elsevier ,1980
• `` Strong '' NP-Completeness Results
  Journal of the ACM, 1978
• Hyperrhombs inscribed to concex bodies
  Journal of Combinatorial Theory, Series B, 1978
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• A Compactness Theorem For Affine Equivalence-Classes of Convex Regions
  Canadian Journal of Mathematics, 1951