15 citations · 29 across the 3 of their papers we have counts for
3 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.OC2006★ 3 cited
Truncated Markov bases and Gröbner bases for Integer Programming
Peter N. Malkin
We present a new algorithm for computing a truncated Markov basis of a lattice. In general, this new algorithm is faster than existing methods. We then extend this new algorithm so…
math.CO2005★ 15 cited
Computing generating sets of lattice ideals
Raymond Hemmecke, Peter Malkin
In this article, we present a new algorithm for computing a generating set of a lattice ideal. This algorithm is based on a project-and-lift approach and is implemented in 4ti2. We…