Classes |
class | CacheManager |
class | PairStatusSet |
class | PairManager |
class | MonomialHasher |
class | GroebnerStrategy |
class | LessWeightedLengthInStrat |
class | LessWeightedLengthInStratModified |
class | LessEcartThenLessWeightedLengthInStrat |
class | LessUsedTailVariablesThenLessWeightedLengthInStrat |
class | LessCombinedManySizesInStrat |
class | LMLessCompare |
class | SlimgbReduction |
Typedefs |
typedef Monomial::idx_map_type | lm2Index_map_type |
typedef Exponent::idx_map_type | exp2Index_map_type |
typedef SlimgbReduction
< SLIMGB_SIMPLEST > | slimgb_reduction_type |
Functions |
template<class idx_type1 , class idx_type2 > |
void | set_up_translation_vectors (std::vector< idx_type1 > &ring_2_0123, std::vector< idx_type2 > &back_2_ring, const Exponent &used_variables) |
Polynomial | translate_indices (const Polynomial &p, const std::vector< idx_type > &table) |
MonomialSet | minimal_elements (const MonomialSet &s) |
Polynomial | map_every_x_to_x_plus_one (Polynomial p) |
MonomialSet | mod_var_set (const MonomialSet &as, const MonomialSet &vs) |
void | groebner (GroebnerStrategy &strat) |
Polynomial | reduce_by_binom (const Polynomial &p, const Polynomial &binom) |
Polynomial | reduce_by_monom (const Polynomial &p, const Monomial &m) |
Polynomial | reduce_complete (const Polynomial &p, const Polynomial &reductor) |
wlen_type | wlen_literal_exceptioned (const PolyEntry &e) |
Polynomial | mult_fast_sim (const std::vector< Polynomial > &vec) |
std::vector< Polynomial > | full_implication_gb (const Polynomial &p, CacheManager &cache, GroebnerStrategy &strat) |
Polynomial | reduce_complete (const Polynomial &p, const PolyEntry &reductor, wlen_type &len) |
MonomialSet | contained_variables_cudd_style (const MonomialSet &m) |
MonomialSet | minimal_elements_cudd_style (MonomialSet m) |
MonomialSet | recursively_insert (MonomialSet::navigator p, idx_type idx, MonomialSet mset) |
MonomialSet | minimal_elements_cudd_style_unary (MonomialSet m) |
Polynomial | add_up_exponents (const std::vector< Exponent > &vec) |
Polynomial | add_up_monomials (const std::vector< Monomial > &res_vec) |
int | select1 (const GroebnerStrategy &strat, const Polynomial &p) |
int | select1 (const GroebnerStrategy &strat, const Monomial &m) |
int | select_no_deg_growth (const GroebnerStrategy &strat, const Monomial &m) |
Polynomial | nf1 (GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf2 (GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf2_short (GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf_delaying (GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf_delaying_exchanging (GroebnerStrategy &strat, Polynomial p) |
std::vector< Polynomial > | parallel_reduce (std::vector< Polynomial > inp, GroebnerStrategy &strat, int average_steps, double delay_f) |
Polynomial | red_tail (const GroebnerStrategy &strat, Polynomial p) |
Polynomial | red_tail_short (const GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf3 (const GroebnerStrategy &strat, Polynomial p, Monomial rest_lead) |
Polynomial | nf3_short (const GroebnerStrategy &strat, Polynomial p) |
Polynomial | red_tail_self_tuning (const GroebnerStrategy &strat, Polynomial p) |
Polynomial | ll_red_nf (const Polynomial &p, const BooleSet &reductors) |
Polynomial | ll_red_nf_noredsb (const Polynomial &p, const BooleSet &reductors) |
Polynomial | add_up_polynomials (const std::vector< Polynomial > &vec) |
Polynomial | plug_1 (const Polynomial &p, const MonomialSet &m_plus_ones) |
MonomialSet | mod_mon_set (const MonomialSet &as, const MonomialSet &vs) |
MonomialSet | random_set_using_generator (const Monomial &variables, unsigned int len, bool_gen_type &bit_gen) |
MonomialSet | random_set (const Monomial &variables, unsigned int len) |
Variables |
const int | SLIMGB_SIMPLEST = 0 |