189{
192
197 else
199
203
204 if (
A.isUnivariate())
205 {
209 else
212 if (
result.getFirst().inCoeffDomain())
215 }
216
220
223
226
229
231 {
233 {
237 }
239 {
243 }
244 }
245 else
246 {
248 {
252 }
254 {
258 }
259 }
260
261
264 {
267
270
273 }
274
275
277 if (
A.inCoeffDomain())
278 {
283 }
284 else if (
A.isUnivariate())
285 {
288 else
294 }
295
297 {
300
303
306 }
309 {
312 }
313
318
324
325
326
327
334 {
339
344 "time for eval point over Q in y: ");
345
346
350 else
353 "time for univariate factorization over Q: ");
356
359
361 {
363
366
370 }
371
375 else
378 "time for univariate factorization in y over Q: ");
381
385 {
387
390
394 }
395
397 {
399 {
401
403 {
413 }
414 }
415
417 {
419
421 {
431 }
432 }
433 }
434
435
438
440 {
449 }
450 else
451 {
455 {
459 }
461 {
465 }
466 }
469 else
473 else
475 }
476
479 &&
degs.getLength() >
degs2.getLength()))
480 {
487 }
488
489 if (
degs.getLength() == 1)
490 {
497 }
498
501
503
508 {
515 printf (
"out of primes\n");
516
520 if (
bb.getk() >
b.getk() )
b=
bb;
522 if (
bb.getk() >
b.getk() )
b=
bb;
523 }
524 else
525 {
529 #ifdef HAVE_FLINT
530
536
539
543
545
547
550 #elif defined(HAVE_NTL)
556 #else
558 #endif
559
560
563 {
566 }
569
572 #ifdef HAVE_FLINT
575 #elif defined(HAVE_NTL)
577 #else
579 #endif
583
587 if (
bb.getk() >
b.getk() )
b=
bb;
589 if (
bb.getk() >
b.getk() )
b=
bb;
590 }
591
602 "time for bivariate hensel lifting over Q: ");
604
606
608 {
612 break;
615
616 }
617
621
626 "time for bivariate factor recombination over Q: ");
627
629
634
639
641}
CanonicalForm convertFmpz2CF(const fmpz_t coefficient)
conversion of a FLINT integer to CanonicalForm
void convertFacCF2Fmpz_poly_t(fmpz_poly_t result, const CanonicalForm &f)
conversion of a factory univariate polynomial over Z to a fmpz_poly_t
Rational abs(const Rational &a)
CanonicalForm convertZZ2CF(const ZZ &a)
NAME: convertZZ2CF.
ZZX convertFacCF2NTLZZX(const CanonicalForm &f)
const CanonicalForm CFMap CFMap & N
bool irreducibilityTest(const CanonicalForm &F)
computes the Newton polygon of F and checks if it satisfies the irreducibility criterion from S....
CanonicalForm decompress(const CanonicalForm &F, const mpz_t *inverseM, const mpz_t *A)
decompress a bivariate poly
CanonicalForm bCommonDen(const CanonicalForm &f)
CanonicalForm bCommonDen ( const CanonicalForm & f )
CFFList FACTORY_PUBLIC factorize(const CanonicalForm &f, bool issqrfree=false)
factorization over or
CanonicalForm FACTORY_PUBLIC resultant(const CanonicalForm &f, const CanonicalForm &g, const Variable &x)
CanonicalForm resultant ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x )
static const int SW_RATIONAL
set to 1 for computations over Q
CanonicalForm compress(const CanonicalForm &f, CFMap &m)
CanonicalForm compress ( const CanonicalForm & f, CFMap & m )
int cf_getBigPrime(int i)
VAR void(* factoryError)(const char *s)
DegreePattern provides a functionality to create, intersect and refine degree patterns.
ExtensionInfo contains information about extension.
factory's class for variables
class to do operations mod p^k for int's p and k
#define DEBOUTLN(stream, objects)
const CanonicalForm int const CFList & evaluation
const CanonicalForm int const CFList const Variable & y
CFFList append(const CFFList &Inputlist, const CFFactor &TheFactor)
CanonicalForm subst(const CanonicalForm &f, const CFList &a, const CFList &b, const CanonicalForm &Rstar, bool isFunctionField)
modpk coeffBound(const CanonicalForm &f, int p, const CanonicalForm &mipo)
compute p^k larger than the bound on the coefficients of a factor of f over Q (mipo)
CanonicalForm evalPoint(const CanonicalForm &F, int &i)
CFList conv(const CFFList &L)
convert a CFFList to a CFList by dropping the multiplicity
CFList biFactorize(const CanonicalForm &F, const Variable &v)
void findGoodPrime(const CanonicalForm &f, int &start)
find a big prime p from our tables such that no term of f vanishes mod p
const Variable & v
< [in] a sqrfree bivariate poly
CFList *& Aeval
<[in] poly
void appendSwapDecompress(CFList &factors1, const CFList &factors2, const CFList &factors3, const bool swap1, const bool swap2, const CFMap &N)
first swap Variables in factors1 if necessary, then append factors2 and factors3 on factors1 and fina...
CanonicalForm reverseSubst(const CanonicalForm &F, const int d, const Variable &x)
reverse a substitution x^d->x
int substituteCheck(const CanonicalForm &F, const Variable &x)
check if a substitution x^n->x is possible
CFList henselLiftAndEarly(CanonicalForm &A, bool &earlySuccess, CFList &earlyFactors, DegreePattern °s, int &liftBound, const CFList &uniFactors, const ExtensionInfo &info, const CanonicalForm &eval, modpk &b, CanonicalForm &den)
hensel Lifting and early factor detection
CFList factorRecombination(CFList &factors, CanonicalForm &F, const CanonicalForm &N, DegreePattern °s, const CanonicalForm &eval, int s, int thres, const modpk &b, const CanonicalForm &den)
naive factor recombination as decribed in "Factoring multivariate polynomials over a finite field" by...
CanonicalForm getMipo(const Variable &alpha, const Variable &x)
template List< Variable > Union(const List< Variable > &, const List< Variable > &)
int status int void * buf
static poly normalize(poly next_p, ideal add_generators, syStrategy syzstr, int *g_l, int *p_l, int crit_comp)
#define TIMING_END_AND_PRINT(t, msg)