My Project
|
#include "config.h"
#include "canonicalform.h"
#include "cf_factory.h"
#include "cf_reval.h"
#include "cf_util.h"
#include "cf_iter.h"
#include "gfops.h"
#include "cf_map_ext.h"
#include "templates/ftmpl_functions.h"
#include "NTLconvert.h"
#include "FLINTconvert.h"
Go to the source code of this file.
Macros | |
#define | TEST_ONE_MAX 50 |
Functions | |
bool | gcd_test_one (const CanonicalForm &f, const CanonicalForm &g, bool swap, int &d) |
Coprimality Check. f and g are assumed to have the same level. If swap is true, the main variables of f and g are swapped with Variable(1). If the result is false, d is set to the degree of the gcd of f and g evaluated at a random point in K^n-1. This gcd is a gcd of univariate polynomials. More... | |
CanonicalForm | balance_p (const CanonicalForm &f, const CanonicalForm &q, const CanonicalForm &qh) |
same as balance_p ( const CanonicalForm & f, const CanonicalForm & q ) but qh= q/2 is provided, too. More... | |
CanonicalForm | balance_p (const CanonicalForm &f, const CanonicalForm &q) |
static CanonicalForm balance_p ( const CanonicalForm & f, const CanonicalForm & q ) More... | |
#define TEST_ONE_MAX 50 |
CanonicalForm balance_p | ( | const CanonicalForm & | f, |
const CanonicalForm & | q | ||
) |
static CanonicalForm balance_p ( const CanonicalForm & f, const CanonicalForm & q )
balance_p() - map f from positive to symmetric representation mod q.
This makes sense for polynomials over Z only. q should be an integer.
Definition at line 290 of file cfGcdUtil.cc.
CanonicalForm balance_p | ( | const CanonicalForm & | f, |
const CanonicalForm & | q, | ||
const CanonicalForm & | qh | ||
) |
same as balance_p ( const CanonicalForm & f, const CanonicalForm & q ) but qh= q/2 is provided, too.
Definition at line 258 of file cfGcdUtil.cc.
bool gcd_test_one | ( | const CanonicalForm & | f, |
const CanonicalForm & | g, | ||
bool | swap, | ||
int & | d | ||
) |
Coprimality Check. f and g are assumed to have the same level. If swap is true, the main variables of f and g are swapped with Variable(1). If the result is false, d is set to the degree of the gcd of f and g evaluated at a random point in K^n-1. This gcd is a gcd of univariate polynomials.
Definition at line 25 of file cfGcdUtil.cc.