Classes |
class | GBTypes |
class | LexBucket |
class | LiteralFactorization |
class | PolynomialSugar |
class | LMLessComparePS |
class | PSCompareByEl |
class | IsEcart0Predicate |
class | LexHelper |
class | DegOrderHelper |
class | BlockOrderHelper |
class | LexOrderGreaterComparer |
class | LMLessCompare |
class | SlimgbReduction |
class | PolyEntry |
class | PairData |
class | IJPairData |
class | PolyPairData |
class | VariablePairData |
class | PairLS |
class | PairE |
class | PairLSCompare |
class | PairECompare |
Typedefs |
typedef polybori::BoolePolynomial | Polynomial |
typedef polybori::BooleMonomial | Monomial |
typedef polybori::BooleVariable | Variable |
typedef polybori::BooleExponent | Exponent |
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 SlimgbReduction
< SLIMGB_SIMPLEST > | slimgb_reduction_type |
typedef std::vector< PolyEntry > | PolyEntryVector |
typedef boost::shared_ptr
< PairData > | pair_data_ptr |
typedef PairE | Pair |
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 |
Enumerations |
enum | { VARIABLE_PAIR,
IJ_PAIR,
DELAYED_PAIR
} |
Functions |
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) |
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) |
template<class T > |
Polynomial | add_up_generic (const std::vector< T > &res_vec, Polynomial init) |
Polynomial | nf1 (GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf2 (GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf2_short (GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf3 (const GroebnerStrategy &strat, Polynomial p, Monomial rest_lead) |
Polynomial | nf3_lexbuckets (const GroebnerStrategy &strat, Polynomial p, Monomial rest_lead) |
Polynomial | nf3_no_deg_growth (const GroebnerStrategy &strat, Polynomial p, Monomial rest_lead) |
Polynomial | nf3_degree_order (const GroebnerStrategy &strat, Polynomial p, Monomial lead) |
Polynomial | nf3_db (GroebnerStrategy &strat, Polynomial p, int deg_bound) |
Polynomial | nf3_short (const GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf_delaying (GroebnerStrategy &strat, Polynomial p) |
Polynomial | nf_delaying_exchanging (GroebnerStrategy &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_short (const GroebnerStrategy &strat, const Polynomial &p) |
int | select_short (const GroebnerStrategy &strat, const Monomial &m) |
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) |
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 GroebnerStrategy &strat, Polynomial p) |
template<class Helper > |
Polynomial | red_tail_generic (const GroebnerStrategy &strat, Polynomial p) |
Polynomial | red_tail (const GroebnerStrategy &strat, Polynomial p) |
Polynomial | red_tail_short (const GroebnerStrategy &strat, Polynomial p) |
Polynomial | red_tail_self_tuning (const GroebnerStrategy &strat, Polynomial p) |
template<bool have_redsb> |
Polynomial | ll_red_nf_generic (const Polynomial &, const BooleSet &) |
template<bool have_redsb> |
Polynomial | ll_red_nf_generic (const Polynomial &p, const BooleSet::navigator navi) |
Polynomial | ll_red_nf (const Polynomial &p, const BooleSet &reductors) |
Polynomial | ll_red_nf_noredsb (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) |
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 | lp4var_data [][7] |
const int | FARE_WORSE = 10 |
const int | SLIMGB_SIMPLEST = 0 |