13 #ifndef FAC_FQ_FACTORIZE_UTIL_H 14 #define FAC_FQ_FACTORIZE_UTIL_H 32 i.getItem()=
N (
i.getItem());
94 const int& bivarLiftBound
CFFList sortCFFListByNumOfVars(CFFList &F)
sort CFFList by the number variables in a factor
CanonicalForm reverseShift(const CanonicalForm &F, const CFList &evaluation, int l=2)
reverse shifting the evaluation point to zero
void appendSwap(CFList &factors1, const CFList &factors2, const int swapLevel1, const int swapLevel2, const Variable &x)
swap elements in factors2 and append them to factors1
factory's class for variables
static void decompressAppend(CFList &factors1, const CFList &factors2, const CFMap &N)
append factors2 to factors1 and decompress
CanonicalForm myGetVars(const CanonicalForm &F)
like getVars but each variable x occuring in F is raised to x^degree (F,x)
CFList evaluateAtEval(const CanonicalForm &F, const CFArray &evaluation)
evaluate F at evaluation
CFList recoverFactors(const CanonicalForm &F, const CFList &factors)
divides factors by their content wrt. Variable(1) and checks if these polys divide F
const CanonicalForm int const CFList & evaluation
CFList evaluateAtZero(const CanonicalForm &F)
evaluate F successively n-2 at 0
void appendSwapDecompress(CFList &factors1, const CFList &factors2, const CFMap &N, const int swapLevel, const Variable &x)
swap elements of factors2, append them to factors1 and decompress
const CanonicalForm CFMap CFMap & N
int * liftingBounds(const CanonicalForm &A, const int &bivarLiftBound)
compute lifting bounds
bool isOnlyLeadingCoeff(const CanonicalForm &F)
check if F consists of more than just the leading coeff wrt. Variable (1)
static int index(p_Length length, p_Ord ord)
void swap(CFList &factors, const int swapLevel1, const int swapLevel2, const Variable &x)
swap elements in factors
CanonicalForm shift2Zero(const CanonicalForm &F, CFList &Feval, const CFList &evaluation, int l=2)
shift evaluation point to zero