65 citations · 313 across the 28 of their papers we have counts for
Showing 2004Show all
3 papers · 1 filter
math.CO2004★ 4 cited
Exploiting Symmetries in the Computation of Graver Bases
Raymond Hemmecke
Many challenging Graver bases computations, like for multi-way tables in statistics, have a highly symmetric problem structure that is not exploited so far computationally. In this…
math.OC2004
Integral Function Bases
Raymond Hemmecke, Robert Weismantel
Integral bases, a minimal set of solutions to that generate any other solution to , as a nonnegative integer linear combination, are always…
math.OC2004★ 57 cited
Integer Polynomial Optimization in Fixed Dimension
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe +1
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the…