Using real algebraic geometry to solve combinatorial problems with symmetries
arXiv:1408.1065
Abstract
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we review several applications and discuss implementation and computational aspects.
30 pages. Update v2: Corrected some references. Update v3: Incorporated feedback