Peter N. Malkin

According to our database, Peter N. Malkin authored at least 5 papers between 2008 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2014

Sherali-Adams relaxations of graph isomorphism polytopes.

Peter N. Malkin

Discret. Optim., 2014

2011

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz.

Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies

J. Symb. Comput., 2011

2010

Recognizing Graph Theoretic Properties with Polynomial Ideals.

Jesús A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar

Electron. J. Comb., 2010

2009

Computing generating sets of lattice ideals and Markov bases of lattices.

Raymond Hemmecke, Peter N. Malkin

J. Symb. Comput., 2009

2008

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility.

Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008