Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Journal of Symbolic Computation
Hi-index | 0.06 |