1 #ifndef __REDUCTION_SUPPORT_CPP_ 2 #define __REDUCTION_SUPPORT_CPP_ 21 #include "reduction_support.hpp" 34 bool very_verbose =
false;
39 if (very_verbose) cout <<
"top-reducing\n\t" << *s <<
"\nby\n\t" << *g << endl;
47 s->
strategy()->pre_reduction_tasks(t, *g);
The general class of a polynomial.
virtual bool is_zero() const =0
is this polynomial zero?
virtual Monomial & leading_monomial() const =0
leading monomial – call after sort_by_order()!
virtual Prime_Field_Element leading_coefficient() const =0
leading coefficient – call after sort_by_order()!
Polynomials that need arithmetic typically descend from this class.
Implementation of monomials.
Element of a field of prime characteristic.
void top_reduce(Mutable_Polynomial *s, Abstract_Polynomial *g, int comm_id)
reduce the polynomial **sp by *g
virtual void add_polynomial_multiple(const Prime_Field_Element &, const Monomial &, const Abstract_Polynomial &, bool subtract=false)=0
add monomial multiple of other
virtual Poly_Strategy_Data * strategy() const
strategy related information