The following pages link to Peter N. Malkin (Q650839):
Displaying 6 items.
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Computing generating sets of lattice ideals and Markov bases of lattices (Q840713) (← links)
- Recognizing graph theoretic properties with polynomial ideals (Q1960266) (← links)
- Sherali-Adams relaxations of graph isomorphism polytopes (Q2339812) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility (Q5301623) (← links)