4 citations · 13 across the 8 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2016
Extended Hardness Results for Approximate Gröbner Basis Computation
Gwen Spencer
Two models were recently proposed to explore the robust hardness of Gröbner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some…
cs.SC2015★ 2 cited
On the robust hardness of Gröbner basis computation
Gwen Spencer, David Rolnick
The computation of Gröbner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robu…
cs.SC2014★ 3 cited
Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals
Jesús A. De Loera, Susan Margulies, Michael Pernpeintner +5
We revisit a well-known family of polynomial ideals encoding the problem of graph--colorability. Our paper describes how the inherent combinatorial structure of the ideals impli…