Gr bner bases are the single most important tool in applicable algebraic geometry. This is in part because they can be used to solve systems of polynomial equations. Applications in science and technology are abundant, particularly in cryptography and coding theory. Gr bner bases computation is challenging and a great deal of effort has been devoted to improve algorithms to compute faster larger bases. The concept of mutant polynomials, introduced...