3#ifndef _reducedgb_field_
4#define _reducedgb_field_
Engine-side free module R^n over a Ring.
Polynomial-ring view tuned for the inner loop of classical Buchberger Groebner-basis computations.
Heuristic-weight evaluator for gbvectors, used during Groebner basis computation to drive the S-pair ...
Engine-side monomial ideal: a decision tree of Nmi_nodes storing the (typically minimal) generators b...
Indexed table of monomials with fast "find a divisor" lookup, keyed by a free integer val per entry.
Abstract base for the engine's polynomial-ring hierarchy.
ReducedGB_Field(GBRing *R0, const PolynomialRing *originalR0, const FreeModule *F0, const FreeModule *Fsyz0)
virtual ~ReducedGB_Field()
virtual void remainder(POLY &f, bool use_denom, ring_elem &denom)
virtual void minimalize(const VECTOR(POLY) &polys0, bool auto_reduced)
const MonomialIdeal * Rideal
virtual void set_gb(VECTOR(POLY) &polys0)
static ReducedGB * create(const PolynomialRing *originalR0, const FreeModule *F0, const FreeModule *Fsyz0, const GBWeight *wt0=nullptr)
ReducedGB(GBRing *R0, const PolynomialRing *originalR0, const FreeModule *F0, const FreeModule *Fsyz0)
ReducedGB — abstract base for the canonicalising reduction pass that follows GB computation.