| 1 | /**************************************** |
|---|
| 2 | * Computer Algebra System SINGULAR * |
|---|
| 3 | ****************************************/ |
|---|
| 4 | /* $Id: f5gb.h,v 1.15 2009-01-15 17:44:23 ederc Exp $ */ |
|---|
| 5 | /* |
|---|
| 6 | * ABSTRACT: f5gb interface |
|---|
| 7 | */ |
|---|
| 8 | #ifndef F5_HEADER |
|---|
| 9 | #define F5_HEADER |
|---|
| 10 | |
|---|
| 11 | #ifdef HAVE_F5 |
|---|
| 12 | #include "lpolynomial.h" |
|---|
| 13 | #include "lists.h" |
|---|
| 14 | |
|---|
| 15 | |
|---|
| 16 | /* |
|---|
| 17 | ====================================================== |
|---|
| 18 | sort polynomials in ideal i by decreasing total degree |
|---|
| 19 | ====================================================== |
|---|
| 20 | */ |
|---|
| 21 | void qsort_degree(poly* left, poly* right); |
|---|
| 22 | |
|---|
| 23 | |
|---|
| 24 | /* |
|---|
| 25 | ============================================== |
|---|
| 26 | generating the list lp of ideal generators and |
|---|
| 27 | test if 1 is in lp(return 1) or not(return 0) |
|---|
| 28 | ============================================== |
|---|
| 29 | */ |
|---|
| 30 | void generate_input_list(LPoly* lp, ideal id, poly one); |
|---|
| 31 | |
|---|
| 32 | |
|---|
| 33 | /* |
|---|
| 34 | ================================================== |
|---|
| 35 | computes incrementally gbs of subsets of the input |
|---|
| 36 | gb{f_m} -> gb{f_m,f_(m-1)} -> gb{f_m,...,f_1} |
|---|
| 37 | ================================================== |
|---|
| 38 | */ |
|---|
| 39 | LList* F5inc(const int i, LList* g_prev); |
|---|
| 40 | |
|---|
| 41 | |
|---|
| 42 | /* |
|---|
| 43 | ====================================== |
|---|
| 44 | main function of our f5 implementation |
|---|
| 45 | ====================================== |
|---|
| 46 | */ |
|---|
| 47 | ideal F5main(ideal i, ring r); |
|---|
| 48 | |
|---|
| 49 | #endif |
|---|
| 50 | #endif |
|---|
