93 citations · 387 across the 28 of their papers we have counts for
Showing 2014 · cs.SCShow all
2 papers · 2 filters
cs.SC2014★ 13 cited
On the complexity of computing Gröbner bases for weighted homogeneous systems
Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron
Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a…
cs.SC2014★ 19 cited
Sparse Gröbner Bases: the Unmixed Case
Jean-Charles Faugere, Pierre-Jean Spaenlehauer, Jules Svartz
Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amou…