Discrete and Computational Geometry
From MaRDI portal
Publication:5897088
DOI10.1007/b11261zbMath1179.52022OpenAlexW62175113MaRDI QIDQ5897088
Publication date: 5 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11261
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Inequalities and extremum problems involving convexity in convex geometry (52A40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
The Boolean Quadric Polytope ⋮ Binary Positive Semidefinite Matrices and Associated Integer Polytopes ⋮ Complexity results for the gap inequalities for the max-cut problem ⋮ Binary positive semidefinite matrices and associated integer polytopes
This page was built for publication: Discrete and Computational Geometry
