Changeset b28747 in git
- Timestamp:
- Jul 3, 2020, 10:35:16 AM (3 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- f3adf3a165dd0f173fe615a55624a41ff34bdddb
- Parents:
- a8d220bd457a894b0d527ebb1293c04e2d43bb2c
- Location:
- factory
- Files:
-
- 6 edited
Legend:
- Unmodified
- Added
- Removed
-
factory/cf_chinese.cc
ra8d220b rb28747 163 163 } 164 164 165 #if 0165 #if !defined(HAVE_NTL) && !defined(HAVE_FLINT) 166 166 CanonicalForm Farey_n (CanonicalForm N, const CanonicalForm P) 167 167 //"USAGE: Farey_n (N,P); P, N number; … … 251 251 } 252 252 } 253 #else 254 if (c.inZ()) 255 result += power (x, i.exp()) * Farey_n(c,q); 253 256 #endif 254 257 else -
factory/cf_map_ext.cc
ra8d220b rb28747 440 440 } 441 441 442 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 442 443 CanonicalForm 443 444 mapPrimElem (const CanonicalForm& primElem, const Variable& alpha, … … 490 491 } 491 492 } 493 #endif 492 494 493 495 CanonicalForm -
factory/facFqBivar.cc
ra8d220b rb28747 361 361 } 362 362 363 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 363 364 /// naive factor recombination as decribed in "Factoring 364 365 /// multivariate polynomials over a finite field" by L Bernardin. … … 575 576 return result; 576 577 } 578 #endif 577 579 578 580 /// naive factor recombination as decribed in "Factoring … … 8922 8924 #endif 8923 8925 8926 #ifdef HAVE_NTL // biFactorize 8924 8927 CFList 8925 8928 extBiFactorize (const CanonicalForm& F, const ExtensionInfo& info) … … 9096 9099 } 9097 9100 #endif 9101 #endif -
factory/facFqBivar.h
ra8d220b rb28747 51 51 ); 52 52 53 #ifdef HAVE_NTL // biFactorize 53 54 inline CFList 54 55 biSqrfFactorizeHelper (const CanonicalForm& G, const ExtensionInfo& info) … … 129 130 return result; 130 131 } 132 #endif 131 133 132 134 /// factorize a squarefree bivariate polynomial over \f$ F_{p} \f$. … … 135 137 /// element is the leading coefficient. 136 138 /// @sa FqBiSqrfFactorize(), GFBiSqrfFactorize() 139 #ifdef HAVE_NTL // biSqrfFactorizeHelper, biFactorize 137 140 inline 138 141 CFList FpBiSqrfFactorize (const CanonicalForm & G ///< [in] a bivariate poly … … 142 145 return biSqrfFactorizeHelper (G, info); 143 146 } 147 #endif 144 148 145 149 /// factorize a squarefree bivariate polynomial over \f$ F_{p}(\alpha ) \f$. … … 148 152 /// element is the leading coefficient. 149 153 /// @sa FpBiSqrfFactorize(), GFBiSqrfFactorize() 154 #ifdef HAVE_NTL // biSqrfFactorizeHelper, biFactorize 150 155 inline 151 156 CFList FqBiSqrfFactorize (const CanonicalForm & G, ///< [in] a bivariate poly … … 156 161 return biSqrfFactorizeHelper (G, info); 157 162 } 163 #endif 158 164 159 165 /// factorize a squarefree bivariate polynomial over GF … … 162 168 /// element is the leading coefficient. 163 169 /// @sa FpBiSqrfFactorize(), FqBiSqrfFactorize() 170 #ifdef HAVE_NTL // biSqrfFactorizeHelper, biFactorize 164 171 inline 165 172 CFList GFBiSqrfFactorize (const CanonicalForm & G ///< [in] a bivariate poly … … 171 178 return biSqrfFactorizeHelper (G, info); 172 179 } 180 #endif 173 181 174 182 /// factorize a bivariate polynomial over \f$ F_{p} \f$ … … 177 185 /// multiplicity, the first element is the leading coefficient. 178 186 /// @sa FqBiFactorize(), GFBiFactorize() 187 #ifdef HAVE_NTL // biFactorize 179 188 inline 180 189 CFFList … … 296 305 return result; 297 306 } 307 #endif 298 308 299 309 /// factorize a bivariate polynomial over \f$ F_{p}(\alpha ) \f$ … … 302 312 /// multiplicity, the first element is the leading coefficient. 303 313 /// @sa FpBiFactorize(), FqBiFactorize() 314 #ifdef HAVE_NTL // biFactorize 304 315 inline 305 316 CFFList … … 423 434 return result; 424 435 } 436 #endif 425 437 426 438 /// factorize a bivariate polynomial over GF … … 429 441 /// multiplicity, the first element is the leading coefficient. 430 442 /// @sa FpBiFactorize(), FqBiFactorize() 443 #ifdef HAVE_NTL // biFactorize 431 444 inline 432 445 CFFList … … 551 564 return result; 552 565 } 566 #endif 553 567 554 568 /// \f$ \prod_{f\in L} {f (0, x)} \ mod\ M \f$ via divide-and-conquer -
factory/facFqFactorize.cc
ra8d220b rb28747 211 211 } 212 212 213 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 213 214 CFList 214 215 extFactorRecombination (const CFList& factors, const CanonicalForm& F, … … 353 354 return result; 354 355 } 355 356 #endif 357 358 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 356 359 CFList 357 360 factorRecombination (const CanonicalForm& F, const CFList& factors, … … 438 441 return result; 439 442 } 440 443 #endif 444 445 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 441 446 int 442 447 liftBoundAdaption (const CanonicalForm& F, const CFList& factors, bool& … … 502 507 return adaptedLiftBound; 503 508 } 504 509 #endif 510 511 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 505 512 int 506 513 extLiftBoundAdaption (const CanonicalForm& F, const CFList& factors, bool& … … 598 605 return adaptedLiftBound; 599 606 } 600 607 #endif 608 609 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 601 610 CFList 602 611 earlyFactorDetect (CanonicalForm& F, CFList& factors, int& adaptedLiftBound, … … 649 658 return result; 650 659 } 651 660 #endif 661 662 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 652 663 CFList 653 664 extEarlyFactorDetect (CanonicalForm& F, CFList& factors, int& adaptedLiftBound, … … 732 743 return result; 733 744 } 745 #endif 734 746 735 747 #if defined(HAVE_NTL) || defined(HAVE_FLINT) … … 968 980 } 969 981 982 #ifdef HAVE_NTL // henselLift23 970 983 CFList 971 984 henselLiftAndEarly (CanonicalForm& A, CFList& MOD, int*& liftBounds, bool& … … 1250 1263 return result; 1251 1264 } 1265 #endif 1252 1266 1253 1267 void … … 1460 1474 } 1461 1475 1476 #ifdef HAVE_NTL // nonMonicHenselLift12 1462 1477 CFList 1463 1478 precomputeLeadingCoeff (const CanonicalForm& LCF, const CFList& LCFFactors, … … 1945 1960 return result; 1946 1961 } 1962 #endif 1947 1963 1948 1964 void … … 2163 2179 2164 2180 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 2181 #ifdef HAVE_NTL // GFBiSqrfFactorize 2165 2182 void 2166 2183 factorizationWRTDifferentSecondVars (const CanonicalForm& A, CFList*& Aeval, … … 2201 2218 } 2202 2219 } 2220 #endif 2203 2221 #endif 2204 2222 … … 2903 2921 2904 2922 #if defined(HAVE_NTL) || defined(HAVE_FLINT) 2923 #ifdef HAVE_NTL // biSqrfFactorizeHelper 2905 2924 CFList 2906 2925 extFactorize (const CanonicalForm& F, const ExtensionInfo& info); … … 3634 3653 return factors; 3635 3654 } 3655 #endif 3636 3656 3637 3657 /// multivariate factorization over an extension of the initial field 3658 #ifdef HAVE_NTL // multiFactorize 3638 3659 CFList 3639 3660 extFactorize (const CanonicalForm& F, const ExtensionInfo& info) … … 3828 3849 } 3829 3850 #endif 3851 #endif -
factory/facHensel.cc
ra8d220b rb28747 474 474 diophantine (const CanonicalForm& F, const CFList& factors); 475 475 476 #ifdef HAVE_NTL // diophantine 476 477 CFList 477 478 diophantineHensel (const CanonicalForm & F, const CFList& factors, … … 563 564 return result; 564 565 } 566 #endif 565 567 566 568 /// solve \f$ 1=\sum_{i=1}^n{\delta_{i} \prod_{j\neq i}{f_j}} \f$ mod \f$p^k\f$
Note: See TracChangeset
for help on using the changeset viewer.