On the complexity of computing Gröbner bases for weighted homogeneous systems

We provide some experimental results based on systems arising from a cryptography problem and from polynomial inversion problems. They show that taking advantage of the weighted homogeneous structure can yield substantial speed-ups, and allows us to solve systems which were otherwise out of reach.