| |
- VariableBlock(...)
- C++ signature:
VariableBlock(int, int, int, bool) -> boost::python::api::object
- add_up_polynomials(...)
- C++ signature:
add_up_polynomials(std::vector<polybori::BoolePolynomial, std::allocator<polybori::BoolePolynomial> >) -> polybori::BoolePolynomial
- append_ring_block(...)
- Append integer, which marks start of next block (for block orderings)
C++ signature:
append_ring_block(int) -> void*
- change_order_heuristic(d)
- change_ordering(...)
- C++ signature:
change_ordering(int) -> void*
- clean_polys(I)
- clean_polys_pre(I)
- contained_vars(...)
- C++ signature:
contained_vars(polybori::BooleSet) -> polybori::BooleSet
- count_double(...)
- C++ signature:
count_double(polybori::BooleSet) -> double
- fix_deg_bound_post(I, state)
- gb_with_pre_post_option(option, pre=None, post=None, if_not_option=(), default=False, pass_option_set=False)
- get_order_code(...)
- C++ signature:
get_order_code(void) -> int
- global_ring(...)
- C++ signature:
global_ring(void) -> polybori::BoolePolyRing
- groebner_basis(I, **kwds)
- Computes a Groebner basis of a given ideal I, w.r.t options.
Options are:
faugere : False
interpolation_gb : False
linear_algebra_in_last_block : True
selection_size : 1000
preprocess_only : False
heuristic : True
clean_arguments : True
full_prot : False
recursion : False
ll : False
prot : False
fix_deg_bound : True
step_factor : 1
deg_bound : False
lazy : True
max_growth : 2.0
exchange : True
matrix_prefix : 'matrix'
red_tail : True
implementation : 'Python'
ll_constants : True
result_to_list : True
aes : False
llfirst : False
other_ordering_first : False
noro : False
redsb : True
implications : False
draw_matrices : False
gauss_on_linear_first : True
minsb : True
invert : False
llfirstonthefly : False
unique_ideal_generator : False
Turn off heuristic by setting heuristic=False
- have_degree_order(...)
- Determines, whether ring ordering is a degree ordering
C++ signature:
have_degree_order(void) -> bool
- if_then_else(...)
- if-then else operator
C++ signature:
if_then_else(int, polybori::BooleSet, polybori::BooleSet) -> polybori::BooleSet
if-then else operator
C++ signature:
if_then_else(polybori::BooleVariable, polybori::BooleSet, polybori::BooleSet) -> polybori::BooleSet
- interpolate(...)
- C++ signature:
interpolate(polybori::BooleSet, polybori::BooleSet) -> polybori::BoolePolynomial
- interpolate_smallest_lex(...)
- C++ signature:
interpolate_smallest_lex(polybori::BooleSet, polybori::BooleSet) -> polybori::BoolePolynomial
- interpolation_gb_heuristic(d)
- invert_all(I)
- invert_all_post(I, state)
- invert_all_pre(I)
- linear_algebra_heuristic(d)
- ll_constants_post(I, eliminated)
- ll_constants_pre(I)
- ll_heuristic(d)
- ll_is_good(I)
- ll_red_nf(...)
- C++ signature:
ll_red_nf(polybori::BoolePolynomial, polybori::BooleSet) -> polybori::BoolePolynomial
- ll_red_nf_noredsb(...)
- C++ signature:
ll_red_nf_noredsb(polybori::BoolePolynomial, polybori::BooleSet) -> polybori::BoolePolynomial
- llfirst_post(I, eliminated)
- llfirst_pre(I)
- llfirstonthefly_pre(I)
- map_every_x_to_x_plus_one(...)
- C++ signature:
map_every_x_to_x_plus_one(polybori::BoolePolynomial) -> polybori::BoolePolynomial
- mapping(...)
- C++ signature:
mapping(polybori::BoolePolynomial, polybori::BooleMonomial, polybori::BooleMonomial) -> polybori::BoolePolynomial
- minsb_post(I, state)
- mod_mon_set(...)
- C++ signature:
mod_mon_set(polybori::BooleSet, polybori::BooleSet) -> polybori::BooleSet
C++ signature:
mod_mon_set(polybori::BooleSet, polybori::BooleSet) -> polybori::BooleSet
- mod_var_set(...)
- C++ signature:
mod_var_set(polybori::BooleSet, polybori::BooleSet) -> polybori::BooleSet
- mult_fast_sim_C(...)
- C++ signature:
mult_fast_sim_C(std::vector<polybori::BoolePolynomial, std::allocator<polybori::BoolePolynomial> >) -> polybori::BoolePolynomial
- nf3(...)
- C++ signature:
nf3(polybori::groebner::GroebnerStrategy, polybori::BoolePolynomial, polybori::BooleMonomial) -> polybori::BoolePolynomial
- number_of_variables(...)
- Number of variables in the active ring
C++ signature:
number_of_variables(void) -> unsigned int
- one(...)
- Constant one of the active ring
C++ signature:
one(void) -> polybori::CDDInterface<polybori::CCuddZDD>
- other_ordering_pre(I, options)
- owns_one_constant(I)
- Determines whether I contains the constant one polynomial.
- parallel_reduce(...)
- C++ signature:
parallel_reduce(std::vector<polybori::BoolePolynomial, std::allocator<polybori::BoolePolynomial> >, polybori::groebner::GroebnerStrategy {lvalue}, int, double) -> std::vector<polybori::BoolePolynomial, std::allocator<polybori::BoolePolynomial> >
- print_ring_info(...)
- C++ signature:
print_ring_info(void) -> void*
- random_set(...)
- C++ signature:
random_set(polybori::BooleMonomial, unsigned int) -> polybori::BooleSet
- recursively_insert(...)
- C++ signature:
recursively_insert(polybori::CCuddNavigator, int, polybori::BooleSet) -> polybori::BooleSet
- redsb_post(I, state)
- result_to_list_post(I, state)
- set_variable_name(...)
- C++ signature:
set_variable_name(int, char const*) -> void*
- spoly(...)
- Compute s-Polynomial between two Polynomials
C++ signature:
spoly(polybori::BoolePolynomial, polybori::BoolePolynomial) -> polybori::BoolePolynomial
- test_iterate_lex(...)
- C++ signature:
test_iterate_lex(polybori::BoolePolynomial {lvalue}) -> unsigned long
- test_iterate_ordered(...)
- C++ signature:
test_iterate_ordered(polybori::BoolePolynomial {lvalue}) -> unsigned long
- test_iterate_reference_ordered(...)
- C++ signature:
test_iterate_reference_ordered(polybori::BoolePolynomial {lvalue}) -> unsigned long
- testvalidstrat(...)
- C++ signature:
testvalidstrat(polybori::groebner::GroebnerStrategy) -> void*
- time(...)
- time() -> floating point number
Return the current time in seconds since the Epoch.
Fractions of a second may be present if the system clock provides them.
- top_index(...)
- C++ signature:
top_index(polybori::BooleSet) -> int
- translate_indices(...)
- C++ signature:
translate_indices(polybori::BoolePolynomial, std::vector<int, std::allocator<int> >) -> polybori::BoolePolynomial
- trivial_heuristic(d)
- variety_lex_groebner_basis(...)
- C++ signature:
variety_lex_groebner_basis(polybori::BooleSet, polybori::BooleMonomial) -> std::vector<polybori::BoolePolynomial, std::allocator<polybori::BoolePolynomial> >
- variety_lex_leading_terms(...)
- C++ signature:
variety_lex_leading_terms(polybori::BooleSet, polybori::BooleMonomial) -> polybori::BooleSet
- want_interpolation_gb(G)
- with_heuristic(heuristic_function)
- zero(...)
- Constant zero of the active ring
C++ signature:
zero(void) -> polybori::CDDInterface<polybori::CCuddZDD>
|