 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the documentation of this file.
13 #ifndef CF_GCD_ALGEXT_H
14 #define CF_GCD_ALGEXT_H
38 bool isLess(
int *a,
int *
b,
int lower,
int upper);
39 bool isEqual(
int *a,
int *
b,
int lower,
int upper);
int * leadDeg(const CanonicalForm &f, int *degs)
CanonicalForm QGCD(const CanonicalForm &, const CanonicalForm &)
gcd over Q(a)
CanonicalForm firstLC(const CanonicalForm &f)
bool isLess(int *a, int *b, int lower, int upper)
void tryBrownGCD(const CanonicalForm &F, const CanonicalForm &G, const CanonicalForm &M, CanonicalForm &result, bool &fail, bool topLevel=true)
modular gcd over F_p[x]/(M) for not necessarily irreducible M. If a zero divisor is encountered fail ...
bool isEqual(int *a, int *b, int lower, int upper)
const CanonicalForm CFMap CFMap bool topLevel
const CanonicalForm int s
void tryInvert(const CanonicalForm &, const CanonicalForm &, CanonicalForm &, bool &)