Labeled polynomials are used in advanced versions of the Gröbner bases algorithm with application of the criteria to detect zero-reductions, where one frequently has to check for equality of polynomials in the basis. Each polynomial gets a (different) label before it is adjoined to the basis. This allows the equality-check between basis polynomials to be performed by just checking equality of the integer labels.