15 citations · 26 across the 2 of their papers we have counts for
2 papers
math.CO2008★ 11 cited
Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility
J. A. De Loera, J. Lee, P. Malkin +1
Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e…
math.CO2007★ 15 cited
Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz
J. A. De Loera, J. Lee, S. Margulies +1
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-co…