On the complexity of computing gröbner bases for quasi-homogeneous systems
Jean‐Charles Faugère, Mohab Safey El Din, Thibaut Verron · 2013
Let K be a field and (f1, ..., fn)\subset K[X1, ..., Xn] be a sequence of quasi-homogeneous polynomials of respective weighted degrees (d1, ..., dn) w.r.t a system of weights (w1,...,wn). Such systems are likely to arise from a lot of applications, including physics or cryptography.