|
PolyBoRi
|
Classes | |
| class | CacheManager |
| class | FGLMNoLinearCombinationException |
| class | FGLMStrategy |
| class | ChainCriterion |
| assumes that divisibility condition is fullfilled More... | |
| class | ChainVariableCriterion |
| class | HasTRepOrExtendedProductCriterion |
| class | SetBitUInt |
| class | ZeroFunction |
| class | ShorterEliminationLength |
| class | ShorterEliminationLengthModified |
| class | GBTypes |
| class | LexBucket |
| class | LiteralFactorization |
| class | LiteralFactorizationIterator |
| class | PolynomialSugar |
| class | LMLessComparePS |
| class | PSCompareByEl |
| class | IsEcart0Predicate |
| class | LexHelper |
| class | DegOrderHelper |
| class | BlockOrderHelper |
| class | LexOrderGreaterComparer |
| class | LLReduction |
Typedefs | |
| typedef std::vector< Polynomial > | poly_vec |
| typedef polybori::CacheManager < CCacheTypes::divisorsof > | fixed_divisors_cache_type |
| typedef polybori::BoolePolynomial | Polynomial |
| typedef polybori::BooleMonomial | Monomial |
| typedef polybori::BooleVariable | Variable |
| typedef polybori::BooleExponent | Exponent |
| typedef std::vector< Polynomial > | PolynomialVector |
| typedef long long | wlen_type |
| typedef long | len_type |
| typedef int | deg_type |
| typedef polybori::CTypes::idx_type | idx_type |
| typedef polybori::BooleSet | MonomialSet |
| typedef LessWeightedLengthInStratModified | StratComparerForSelect |
| typedef boost::minstd_rand | base_generator_type |
| typedef boost::uniform_smallint | distribution_type |
| typedef boost::variate_generator < base_generator_type &, distribution_type > | bool_gen_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) |
| void | transpose_window_to_row (mzd_t *transposed_vec, mzd_t *window) |
| void | clear_mat (mzd_t *mat) |
| template<class CacheMgr > | |
| MonomialSet | mod_var_set (const CacheMgr &cache_mgr, MonomialSet::navigator a, MonomialSet::navigator v) |
| MonomialSet | mod_var_set (const MonomialSet &as, const MonomialSet &vs) |
| MonomialSet | mod_deg2_set (const MonomialSet &as, const MonomialSet &vs) |
| template<class CacheMgr > | |
| MonomialSet | mod_deg2_set (const CacheMgr &cache_mgr, MonomialSet::navigator a, MonomialSet::navigator v) |
| MonomialSet | contained_variables_cudd_style (const MonomialSet &m) |
| MonomialSet | contained_deg2_cudd_style (const MonomialSet &m) |
| Polynomial | reduce_by_monom (const Polynomial &p, const Monomial &m) |
| Polynomial | reduce_by_binom (const Polynomial &p, const Polynomial &binom) |
| Polynomial | reduce_complete (const Polynomial &p, const Polynomial &reductor) |
| Polynomial | reduce_complete (const Polynomial &p, const PolyEntry &reductor, wlen_type &len) |
| bool | should_propagate (const PolyEntry &e) |
| MonomialSet | minimal_elements_internal (const MonomialSet &s) |
| MonomialSet | minimal_elements_internal2 (MonomialSet s) |
| std::vector< Exponent > | minimal_elements_internal3 (MonomialSet s) |
| MonomialSet | minimal_elements (const MonomialSet &s) |
| template<class value_type , class initializer , class set_bit > | |
| value_type | p2code (Polynomial p, const std::vector< char > &ring_2_0123, int max_vars) |
| bool | polynomial_in_one_block (const Polynomial p) |
| MonomialSet | minimal_elements_cudd_style_unary (MonomialSet m) |
| MonomialSet | minimal_elements_cudd_style (MonomialSet m) |
| template<class MgrType > | |
| MonomialSet | recursively_insert (const MgrType &mgr, MonomialSet::navigator p, idx_type idx, MonomialSet::navigator m) |
| MonomialSet | recursively_insert (MonomialSet::navigator p, idx_type idx, MonomialSet mset) |
| void | addPolynomialToReductor (Polynomial &p, MonomialSet &m) |
| template<class CacheMgr > | |
| Polynomial | map_every_x_to_x_plus_one (const CacheMgr &cache_mgr, MonomialSet::navigator nav) |
| Polynomial | map_every_x_to_x_plus_one (Polynomial p) |
| Polynomial | red_tail_in_last_block (const GroebnerStrategy &strat, Polynomial p) |
| Polynomial | mult_fast_sim (const std::vector< Polynomial > &vec) |
| std::vector< Polynomial > | full_implication_gb (const Polynomial &p, CacheManager &cache, GroebnerStrategy &strat_param) |
| std::vector< Polynomial > | variety_lex_groebner_basis (const MonomialSet &points, const Monomial &variables) |
| MonomialSet | nf_lex_points (const Polynomial &f, const MonomialSet &p) |
| MonomialSet | gen_random_subset (const std::vector< Monomial > &vec, bool_gen_type &bit_gen) |
| MonomialSet | random_interpolation (const MonomialSet &as_set, const std::vector< Monomial > &as_vector, bool_gen_type &bit_gen) |
| MonomialSet | variety_lex_leading_terms (const MonomialSet &points, const Monomial &variables) |
| MonomialSet | zeros (Polynomial p, MonomialSet candidates) |
| Polynomial | interpolate (MonomialSet to_zero, MonomialSet to_one) |
| Polynomial | interpolate_smallest_lex (MonomialSet to_zero, MonomialSet to_one) |
| MonomialSet | include_divisors (const MonomialSet &m) |
| Polynomial | without_prior_part (Polynomial p, idx_type tail_start) |
| std::vector< Polynomial > | easy_linear_factors (const Polynomial &p) |
| deg_type | common_literal_factors_deg (const LiteralFactorization &a, const LiteralFactorization &b) |
| bool | maps_to_one (const std::pair< const polybori::groebner::idx_type, int > v) |
| bool | maps_to_zero (const std::pair< const polybori::groebner::idx_type, int > v) |
| void | drawmatrix (mzd_t *mat, const char *filename) |
| template<class T > | |
| Polynomial | add_up_generic (const std::vector< T > &res_vec, Polynomial init) |
| Polynomial | nf3 (const ReductionStrategy &strat, Polynomial p, Monomial rest_lead) |
| Polynomial | nf3_lexbuckets (const GroebnerStrategy &strat, Polynomial p, Monomial rest_lead) |
| Polynomial | nf3_no_deg_growth (const ReductionStrategy &strat, Polynomial p, Monomial rest_lead) |
| Polynomial | nf3_degree_order (const ReductionStrategy &strat, Polynomial p, Monomial lead) |
| Polynomial | nf3_short (const ReductionStrategy &strat, Polynomial p) |
| int | sum_size (const MonomialSet &s1, const MonomialSet &s2) |
| std::vector< Polynomial > | parallel_reduce (std::vector< Polynomial > inp, GroebnerStrategy &strat, int average_steps, double delay_f) |
| int | select_largest_degree (const ReductionStrategy &strat, const Monomial &m) |
| int | select_no_deg_growth (const ReductionStrategy &strat, const Monomial &m) |
| template<class T > | |
| Polynomial | add_up_generic (const std::vector< T > &res_vec, int start, int end, Polynomial init) |
| Polynomial | add_up_monomials (const std::vector< Monomial > &vec) |
| Polynomial | add_up_polynomials (const std::vector< Polynomial > &vec) |
| Polynomial | add_up_exponents (const std::vector< Exponent > &vec) |
| Polynomial | red_tail_general (const ReductionStrategy &strat, Polynomial p) |
| Polynomial | cheap_reductions (const ReductionStrategy &strat, Polynomial p) |
| template<class Helper > | |
| Polynomial | red_tail_generic (const ReductionStrategy &strat, Polynomial p) |
| Polynomial | red_tail (const ReductionStrategy &strat, Polynomial p) |
| Polynomial | red_tail_short (const ReductionStrategy &strat, Polynomial p) |
| template<bool have_redsb, bool single_call_for_noredsb, bool fast_multiplication> | |
| Polynomial | ll_red_nf_generic (const Polynomial &, const BooleSet &) |
| template<bool fast> | |
| Polynomial | multiply (const Polynomial &p, const Polynomial &q) |
| template<bool have_redsb, bool single_call_for_noredsb, bool fast_multiplication> | |
| Polynomial | ll_red_nf_generic (const Polynomial &p, MonomialSet::navigator r_nav) |
| Polynomial | ll_red_nf (const Polynomial &p, const BooleSet &reductors) |
| Polynomial | ll_red_nf_noredsb (const Polynomial &p, const BooleSet &reductors) |
| Polynomial | ll_red_nf_noredsb_single_recursive_call (const Polynomial &p, const BooleSet &reductors) |
| Polynomial | do_plug_1 (const Polynomial &p, const MonomialSet &m_plus_ones) |
| Polynomial | plug_1_top (const Polynomial &p, const MonomialSet &m_plus_ones) |
| Polynomial | plug_1 (const Polynomial &p, const MonomialSet &m_plus_ones) |
| MonomialSet | mod_mon_set (const MonomialSet &as, const MonomialSet &vs) |
| Polynomial | do_is_rewriteable (const Polynomial &p, const MonomialSet &leading_terms) |
| bool | is_rewriteable (const Polynomial &p, const MonomialSet &leading_terms) |
| void | set_random_seed (unsigned int seed) |
| 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 unsigned short | dlex4var_data [][7] |
| const unsigned short | dp_asc4var_data [][7] |
| const unsigned short | lp4var_data [][7] |
| const int | FARE_WORSE = 10 |
| typedef boost::minstd_rand polybori::groebner::base_generator_type |
| typedef boost::variate_generator<base_generator_type&, distribution_type> polybori::groebner::bool_gen_type |
| typedef int polybori::groebner::deg_type |
| typedef boost::uniform_smallint polybori::groebner::distribution_type |
| typedef polybori ::CacheManager<CCacheTypes::divisorsof> polybori::groebner::fixed_divisors_cache_type |
| typedef long polybori::groebner::len_type |
| typedef polybori::BooleSet polybori::groebner::MonomialSet |
| typedef std::vector<Polynomial> polybori::groebner::poly_vec |
| typedef std::vector<Polynomial> polybori::groebner::PolynomialVector |
| typedef LessWeightedLengthInStratModified polybori::groebner::StratComparerForSelect |
| typedef long long polybori::groebner::wlen_type |
| Polynomial polybori::groebner::add_up_exponents | ( | const std::vector< Exponent > & | vec | ) |
Referenced by random_set_using_generator().
| Polynomial polybori::groebner::add_up_generic | ( | const std::vector< T > & | res_vec, |
| Polynomial | init | ||
| ) |
| Polynomial polybori::groebner::add_up_generic | ( | const std::vector< T > & | res_vec, |
| int | start, | ||
| int | end, | ||
| Polynomial | init | ||
| ) |
References add_up_generic().
| Polynomial polybori::groebner::add_up_monomials | ( | const std::vector< Monomial > & | vec | ) |
References add_up_generic().
Referenced by gen_random_subset(), polybori::groebner::FGLMStrategy::main(), and polybori::groebner::FGLMStrategy::rowToPoly().
| Polynomial polybori::groebner::add_up_polynomials | ( | const std::vector< Polynomial > & | vec | ) |
References add_up_generic().
Referenced by red_tail_general(), and red_tail_generic().
| void polybori::groebner::addPolynomialToReductor | ( | Polynomial & | p, |
| MonomialSet & | m | ||
| ) |
| Polynomial polybori::groebner::cheap_reductions | ( | const ReductionStrategy & | strat, |
| Polynomial | p | ||
| ) |
References polybori::BoolePolynomial::diagram(), polybori::BoolePolynomial::isZero(), ll_red_nf(), mod_mon_set(), and plug_1().
Referenced by red_tail_generic().
| void polybori::groebner::clear_mat | ( | mzd_t * | mat | ) |
| deg_type polybori::groebner::common_literal_factors_deg | ( | const LiteralFactorization & | a, |
| const LiteralFactorization & | b | ||
| ) |
| MonomialSet polybori::groebner::contained_deg2_cudd_style | ( | const MonomialSet & | m | ) |
References contained_variables_cudd_style().
| MonomialSet polybori::groebner::contained_variables_cudd_style | ( | const MonomialSet & | m | ) |
Referenced by contained_deg2_cudd_style().
| Polynomial polybori::groebner::do_is_rewriteable | ( | const Polynomial & | p, |
| const MonomialSet & | leading_terms | ||
| ) |
| Polynomial polybori::groebner::do_plug_1 | ( | const Polynomial & | p, |
| const MonomialSet & | m_plus_ones | ||
| ) |
References polybori::BoolePolynomial::diagram(), mod_mon_set(), polybori::BoolePolynomial::navigation(), and polybori::BoolePolynomial::ring().
Referenced by plug_1_top().
| void polybori::groebner::drawmatrix | ( | mzd_t * | mat, |
| const char * | filename | ||
| ) |
| std::vector< Polynomial > polybori::groebner::easy_linear_factors | ( | const Polynomial & | p | ) |
| std::vector<Polynomial> polybori::groebner::full_implication_gb | ( | const Polynomial & | p, |
| CacheManager & | cache, | ||
| GroebnerStrategy & | strat_param | ||
| ) |
| MonomialSet polybori::groebner::gen_random_subset | ( | const std::vector< Monomial > & | vec, |
| bool_gen_type & | bit_gen | ||
| ) |
References add_up_monomials(), and polybori::BoolePolynomial::diagram().
Referenced by random_interpolation().
| MonomialSet polybori::groebner::include_divisors | ( | const MonomialSet & | m | ) |
Referenced by variety_lex_leading_terms().
| Polynomial polybori::groebner::interpolate | ( | MonomialSet | to_zero, |
| MonomialSet | to_one | ||
| ) |
| Polynomial polybori::groebner::interpolate_smallest_lex | ( | MonomialSet | to_zero, |
| MonomialSet | to_one | ||
| ) |
References polybori::BoolePolynomial::diagram(), and zeros().
Referenced by nf_lex_points(), and random_interpolation().
| bool polybori::groebner::is_rewriteable | ( | const Polynomial & | p, |
| const MonomialSet & | leading_terms | ||
| ) |
References do_is_rewriteable().
| Polynomial polybori::groebner::ll_red_nf | ( | const Polynomial & | p, |
| const BooleSet & | reductors | ||
| ) |
Referenced by addPolynomialToReductor(), and cheap_reductions().
| Polynomial polybori::groebner::ll_red_nf_generic | ( | const Polynomial & | p, |
| const BooleSet & | reductors | ||
| ) |
References polybori::BoolePolynomial::navigation().
| Polynomial polybori::groebner::ll_red_nf_generic | ( | const Polynomial & | p, |
| MonomialSet::navigator | r_nav | ||
| ) |
References polybori::BoolePolynomial::ring().
| Polynomial polybori::groebner::ll_red_nf_noredsb | ( | const Polynomial & | p, |
| const BooleSet & | reductors | ||
| ) |
| Polynomial polybori::groebner::ll_red_nf_noredsb_single_recursive_call | ( | const Polynomial & | p, |
| const BooleSet & | reductors | ||
| ) |
| Polynomial polybori::groebner::map_every_x_to_x_plus_one | ( | const CacheMgr & | cache_mgr, |
| MonomialSet::navigator | nav | ||
| ) |
References polybori::BoolePolynomial::diagram().
Referenced by map_every_x_to_x_plus_one().
| Polynomial polybori::groebner::map_every_x_to_x_plus_one | ( | Polynomial | p | ) |
| bool polybori::groebner::maps_to_one | ( | const std::pair< const polybori::groebner::idx_type, int > | v | ) |
| bool polybori::groebner::maps_to_zero | ( | const std::pair< const polybori::groebner::idx_type, int > | v | ) |
| MonomialSet polybori::groebner::minimal_elements | ( | const MonomialSet & | s | ) |
References minimal_elements_cudd_style_unary(), and minimal_elements_internal().
| MonomialSet polybori::groebner::minimal_elements_cudd_style | ( | MonomialSet | m | ) |
| MonomialSet polybori::groebner::minimal_elements_cudd_style_unary | ( | MonomialSet | m | ) |
References mod_mon_set().
Referenced by minimal_elements().
| MonomialSet polybori::groebner::minimal_elements_internal | ( | const MonomialSet & | s | ) |
References polybori::BooleMonomial::diagram(), polybori::BoolePolynomial::isOne(), and polybori::BooleMonomial::reducibleBy().
Referenced by minimal_elements().
| MonomialSet polybori::groebner::minimal_elements_internal2 | ( | MonomialSet | s | ) |
| std::vector<Exponent> polybori::groebner::minimal_elements_internal3 | ( | MonomialSet | s | ) |
| MonomialSet polybori::groebner::mod_deg2_set | ( | const MonomialSet & | as, |
| const MonomialSet & | vs | ||
| ) |
Referenced by mod_deg2_set().
| MonomialSet polybori::groebner::mod_deg2_set | ( | const CacheMgr & | cache_mgr, |
| MonomialSet::navigator | a, | ||
| MonomialSet::navigator | v | ||
| ) |
References mod_deg2_set(), and mod_var_set().
| MonomialSet polybori::groebner::mod_mon_set | ( | const MonomialSet & | as, |
| const MonomialSet & | vs | ||
| ) |
| MonomialSet polybori::groebner::mod_var_set | ( | const CacheMgr & | cache_mgr, |
| MonomialSet::navigator | a, | ||
| MonomialSet::navigator | v | ||
| ) |
Referenced by mod_deg2_set(), and mod_var_set().
| MonomialSet polybori::groebner::mod_var_set | ( | const MonomialSet & | as, |
| const MonomialSet & | vs | ||
| ) |
References mod_var_set().
| Polynomial polybori::groebner::mult_fast_sim | ( | const std::vector< Polynomial > & | vec | ) |
References polybori::BoolePolynomial::ring().
| Polynomial polybori::groebner::multiply | ( | const Polynomial & | p, |
| const Polynomial & | q | ||
| ) |
| Polynomial polybori::groebner::nf3 | ( | const ReductionStrategy & | strat, |
| Polynomial | p, | ||
| Monomial | rest_lead | ||
| ) |
| Polynomial polybori::groebner::nf3_degree_order | ( | const ReductionStrategy & | strat, |
| Polynomial | p, | ||
| Monomial | lead | ||
| ) |
References polybori::BoolePolynomial::boundedLead(), polybori::BooleExponent::deg(), polybori::BoolePolynomial::deg(), polybori::BooleMonomial::exp(), polybori::BoolePolynomial::gradedPart(), polybori::BoolePolynomial::isZero(), polybori::BoolePolynomial::lead(), polybori::BoolePolynomial::leadDeg(), and reduce_complete().
Referenced by polybori::groebner::DegOrderHelper::nf(), and red_tail_general().
| Polynomial polybori::groebner::nf3_lexbuckets | ( | const GroebnerStrategy & | strat, |
| Polynomial | p, | ||
| Monomial | rest_lead | ||
| ) |
| Polynomial polybori::groebner::nf3_no_deg_growth | ( | const ReductionStrategy & | strat, |
| Polynomial | p, | ||
| Monomial | rest_lead | ||
| ) |
| Polynomial polybori::groebner::nf3_short | ( | const ReductionStrategy & | strat, |
| Polynomial | p | ||
| ) |
References polybori::BoolePolynomial::lead(), reduce_complete(), and polybori::spoly().
Referenced by red_tail_short().
| MonomialSet polybori::groebner::nf_lex_points | ( | const Polynomial & | f, |
| const MonomialSet & | p | ||
| ) |
References interpolate_smallest_lex(), and zeros().
Referenced by variety_lex_groebner_basis().
| value_type polybori::groebner::p2code | ( | Polynomial | p, |
| const std::vector< char > & | ring_2_0123, | ||
| int | max_vars | ||
| ) |
| std::vector<Polynomial> polybori::groebner::parallel_reduce | ( | std::vector< Polynomial > | inp, |
| GroebnerStrategy & | strat, | ||
| int | average_steps, | ||
| double | delay_f | ||
| ) |
| Polynomial polybori::groebner::plug_1 | ( | const Polynomial & | p, |
| const MonomialSet & | m_plus_ones | ||
| ) |
References plug_1_top().
Referenced by cheap_reductions().
| Polynomial polybori::groebner::plug_1_top | ( | const Polynomial & | p, |
| const MonomialSet & | m_plus_ones | ||
| ) |
References polybori::BoolePolynomial::diagram(), do_plug_1(), and mod_mon_set().
Referenced by plug_1().
| bool polybori::groebner::polynomial_in_one_block | ( | const Polynomial | p | ) |
| MonomialSet polybori::groebner::random_interpolation | ( | const MonomialSet & | as_set, |
| const std::vector< Monomial > & | as_vector, | ||
| bool_gen_type & | bit_gen | ||
| ) |
References gen_random_subset(), and interpolate_smallest_lex().
Referenced by variety_lex_leading_terms().
| MonomialSet polybori::groebner::random_set | ( | const Monomial & | variables, |
| unsigned int | len | ||
| ) |
References random_set_using_generator().
| MonomialSet polybori::groebner::random_set_using_generator | ( | const Monomial & | variables, |
| unsigned int | len, | ||
| bool_gen_type & | bit_gen | ||
| ) |
| MonomialSet polybori::groebner::recursively_insert | ( | const MgrType & | mgr, |
| MonomialSet::navigator | p, | ||
| idx_type | idx, | ||
| MonomialSet::navigator | m | ||
| ) |
Referenced by addPolynomialToReductor(), and recursively_insert().
| MonomialSet polybori::groebner::recursively_insert | ( | MonomialSet::navigator | p, |
| idx_type | idx, | ||
| MonomialSet | mset | ||
| ) |
References recursively_insert().
| Polynomial polybori::groebner::red_tail | ( | const ReductionStrategy & | strat, |
| Polynomial | p | ||
| ) |
References red_tail_general().
Referenced by red_tail_in_last_block().
| Polynomial polybori::groebner::red_tail_general | ( | const ReductionStrategy & | strat, |
| Polynomial | p | ||
| ) |
References add_up_generic(), add_up_polynomials(), polybori::BoolePolynomial::deg(), polybori::BooleMonomial::diagram(), polybori::BoolePolynomial::diagram(), polybori::BoolePolynomial::isZero(), polybori::BoolePolynomial::lead(), polybori::BoolePolynomial::length(), nf3(), nf3_degree_order(), polybori::BoolePolynomial::orderedBegin(), polybori::BoolePolynomial::orderedEnd(), and polybori::BoolePolynomial::ring().
Referenced by red_tail().
| Polynomial polybori::groebner::red_tail_generic | ( | const ReductionStrategy & | strat, |
| Polynomial | p | ||
| ) |
References add_up_polynomials(), cheap_reductions(), polybori::BoolePolynomial::deg(), polybori::BooleMonomial::diagram(), polybori::BoolePolynomial::diagram(), polybori::BoolePolynomial::isZero(), polybori::BoolePolynomial::lead(), polybori::BoolePolynomial::length(), mod_mon_set(), and polybori::BoolePolynomial::ring().
| Polynomial polybori::groebner::red_tail_in_last_block | ( | const GroebnerStrategy & | strat, |
| Polynomial | p | ||
| ) |
| Polynomial polybori::groebner::red_tail_short | ( | const ReductionStrategy & | strat, |
| Polynomial | p | ||
| ) |
References polybori::BoolePolynomial::isZero(), polybori::BoolePolynomial::lead(), and nf3_short().
| Polynomial polybori::groebner::reduce_by_binom | ( | const Polynomial & | p, |
| const Polynomial & | binom | ||
| ) |
| Polynomial polybori::groebner::reduce_by_monom | ( | const Polynomial & | p, |
| const Monomial & | m | ||
| ) |
| Polynomial polybori::groebner::reduce_complete | ( | const Polynomial & | p, |
| const Polynomial & | reductor | ||
| ) |
| Polynomial polybori::groebner::reduce_complete | ( | const Polynomial & | p, |
| const PolyEntry & | reductor, | ||
| wlen_type & | len | ||
| ) |
| int polybori::groebner::select_largest_degree | ( | const ReductionStrategy & | strat, |
| const Monomial & | m | ||
| ) |
| int polybori::groebner::select_no_deg_growth | ( | const ReductionStrategy & | strat, |
| const Monomial & | m | ||
| ) |
Referenced by nf3_no_deg_growth().
| void polybori::groebner::set_random_seed | ( | unsigned int | seed | ) |
| void polybori::groebner::set_up_translation_vectors | ( | std::vector< idx_type1 > & | ring_2_0123, |
| std::vector< idx_type2 > & | back_2_ring, | ||
| const Exponent & | used_variables | ||
| ) |
References polybori::BooleExponent::begin(), and polybori::BooleExponent::end().
Referenced by polybori::groebner::CacheManager::insert(), and polybori::groebner::CacheManager::lookup().
| bool polybori::groebner::should_propagate | ( | const PolyEntry & | e | ) |
| int polybori::groebner::sum_size | ( | const MonomialSet & | s1, |
| const MonomialSet & | s2 | ||
| ) |
| Polynomial polybori::groebner::translate_indices | ( | const Polynomial & | p, |
| const std::vector< idx_type > & | table | ||
| ) |
References polybori::dd_backward_transform(), polybori::BoolePolynomial::diagram(), polybori::BoolePolynomial::isConstant(), polybori::BoolePolynomial::navigation(), and polybori::BoolePolynomial::ring().
Referenced by polybori::groebner::CacheManager::insert(), and polybori::groebner::CacheManager::lookup().
| void polybori::groebner::transpose_window_to_row | ( | mzd_t * | transposed_vec, |
| mzd_t * | window | ||
| ) |
| std::vector< Polynomial > polybori::groebner::variety_lex_groebner_basis | ( | const MonomialSet & | points, |
| const Monomial & | variables | ||
| ) |
References nf_lex_points(), and variety_lex_leading_terms().
| MonomialSet polybori::groebner::variety_lex_leading_terms | ( | const MonomialSet & | points, |
| const Monomial & | variables | ||
| ) |
References polybori::BooleMonomial::divisors(), include_divisors(), and random_interpolation().
Referenced by variety_lex_groebner_basis().
| Polynomial polybori::groebner::without_prior_part | ( | Polynomial | p, |
| idx_type | tail_start | ||
| ) |
| MonomialSet polybori::groebner::zeros | ( | Polynomial | p, |
| MonomialSet | candidates | ||
| ) |
| const unsigned short polybori::groebner::dlex4var_data[][7] |
| const unsigned short polybori::groebner::dp_asc4var_data[][7] |
| const int polybori::groebner::FARE_WORSE = 10 |
| const unsigned short polybori::groebner::lp4var_data[][7] |
1.7.6.1