Returns the  normal form of f w.r.t. rc in the sense of Groebner bases

rc must be a normalized zero-dimensional regular chain and all variables in f must be algebraic w.r.t. rc. See the subpackage ChainTools for these notions.

Moreover R must have a prime characteristic  such that FFT-based polynomial arithmetic can be used for this actual computation. The higher the degrees of f and rc are, the larger must be  such that  divides .  If the degree of  f or rc is too large, then an error is raised.

The algorithm relies on the fast division trick (based on power series inversion) and FFT-based multivariate multiplication. When both commands NormalFormDim0 and NormalForm apply, the former one will often outperform the latter one.