|
| virtual | ~ReducedGB_Field_Local () |
| virtual void | remove_gb () |
| virtual void | minimalize (const VECTOR(POLY) &polys0, bool auto_reduced) |
| virtual void | remainder (POLY &f, bool use_denom, ring_elem &denom) |
| virtual void | remainder (gbvector *&f, bool use_denom, ring_elem &denom) |
| virtual | ~ReducedGB_Field () |
| virtual void | set_gb (VECTOR(POLY) &polys0) |
| virtual | ~ReducedGB () |
| virtual GBComputation * | cast_to_GBComputation () |
| virtual void | start_computation () |
| virtual int | complete_thru_degree () const |
| virtual const Ring * | get_ring () const |
| virtual const Matrix * | get_gb () |
| virtual const Matrix * | get_mingens () |
| virtual const Matrix * | get_change () |
| virtual const Matrix * | get_syzygies () |
| virtual const Matrix * | get_initial (int nparts) |
| virtual const Matrix * | get_parallel_lead_terms (M2_arrayint w) |
| virtual void | text_out (buffer &o) const |
| virtual const Matrix * | matrix_remainder (const Matrix *m) |
| virtual M2_bool | matrix_lift (const Matrix *m, const Matrix **result_remainder, const Matrix **result_quotient) |
| virtual int | contains (const Matrix *m) |
| virtual | ~GBComputation () |
| virtual Computation * | set_hilbert_function (const RingElement *h) |
| Computation * | set_stop_conditions (M2_bool always_stop, M2_arrayint degree_limit, int basis_element_limit, int syzygy_limit, int pair_limit, int codim_limit, int subring_limit, M2_bool just_min_gens, M2_arrayint length_limit) |
| enum ComputationStatusCode | status () const |
| virtual ResolutionComputation * | cast_to_ResolutionComputation () |
| virtual void | show () const |
| | MutableEngineObject () |
| virtual | ~MutableEngineObject () |
| unsigned int | hash () const |
| | our_gc_cleanup () |
| virtual | ~our_gc_cleanup () |
|
| | VECTOR (divisor_info) ring_elems |
| | VECTOR (divisor_info) gb_elems |
| | VECTOR (divisor_info) new _poly_elems |
| | VECTOR (int) alpha |
| | VECTOR (int) ring_alpha |
| | VECTOR (int) new pol_alpha |
| | VECTOR (POLY) new pol |
| bool | find_good_divisor (exponents_t h_exp, int h_comp, int h_deg, int &h_alpha, POLY &result_g, int &result_g_alpha) |
| void | reset_table () |
| void | store_in_table (const POLY &h, exponents_t h_exp, int h_comp, int h_alpha) |
| | ReducedGB_Field_Local (GBRing *R0, const PolynomialRing *originalR0, const FreeModule *F0, const FreeModule *Fsyz0, const GBWeight *wt0) |
| | ReducedGB_Field (GBRing *R0, const PolynomialRing *originalR0, const FreeModule *F0, const FreeModule *Fsyz0) |
| | VECTOR (POLY) polys |
| virtual bool | stop_conditions_ok () |
| | ReducedGB (GBRing *R0, const PolynomialRing *originalR0, const FreeModule *F0, const FreeModule *Fsyz0) |
| | GBComputation () |
| | Computation () |
| enum ComputationStatusCode | set_status (enum ComputationStatusCode) |
| virtual | ~Computation () |
|
| static ReducedGB * | create (const PolynomialRing *originalR0, const FreeModule *F0, const FreeModule *Fsyz0, const GBWeight *wt0=nullptr) |
| static GBComputation * | choose_gb (const Matrix *m, M2_bool collect_syz, int n_rows_to_keep, M2_arrayint gb_weights, M2_bool use_max_degree, int max_degree, int algorithm, int strategy, int numThreads, int max_reduction_count=10) |
| static void * | operator new (size_t size) |
| static void * | operator new[] (size_t size) |
| static void | operator delete (void *obj) |
| static void | operator delete[] (void *obj) |
| static void * | operator new (size_t size, void *existing_memory) |
| static void * | operator new[] (size_t size, void *existing_memory) |
| static void | operator delete (void *obj, void *existing_memory) |
| static void | operator delete[] (void *obj, void *existing_memory) |
Computation of a reduced GB w.r.t. a local order, over a field.
Definition at line 14 of file reducedgb-field-local.hpp.