Changeset 30e27f in git for factory/facBivar.h
 Timestamp:
 Aug 26, 2014, 11:20:18 AM (9 years ago)
 Branches:
 (u'spielwiese', 'e7cc1ebecb61be8b9ca6c18016352af89940b21a')
 Children:
 53e6c3ed92a09bfcbead81b6adcaa7ab3eed1a88
 Parents:
 b53ff6a932a721af73802744f9ad0feefc3dce66
 gitauthor:
 Martin Lee <martinlee84@web.de>20140826 11:20:18+02:00
 gitcommitter:
 Martin Lee <martinlee84@web.de>20140826 12:29:12+02:00
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

factory/facBivar.h
rb53ff6 r30e27f 281 281 ); 282 282 283 /// compute p^k larger than the bound on the coefficients of a factor of @a f 284 /// over Q (mipo) 283 285 modpk 284 coeffBound ( const CanonicalForm & f, int p, const CanonicalForm& mipo ); 285 286 void findGoodPrime(const CanonicalForm &f, int &start); 287 286 coeffBound (const CanonicalForm & f, ///< [in] poly over Z[a] 287 int p, ///< [in] some positive integer 288 const CanonicalForm& mipo ///< [in] minimal polynomial with 289 ///< denominator 1 290 ); 291 292 /// find a big prime p from our tables such that no term of f vanishes mod p 293 void findGoodPrime(const CanonicalForm &f, ///< [in] poly over Z or Z[a] 294 int &start ///< [in,out] index of big prime in 295 /// cf_primetab.h 296 ); 297 298 /// compute p^k larger than the bound on the coefficients of a factor of @a f 299 /// over Z 288 300 modpk 289 coeffBound ( const CanonicalForm & f, int p ); 301 coeffBound (const CanonicalForm & f, ///< [in] poly over Z 302 int p ///< [in] some positive integer 303 ); 290 304 291 305 #endif
Note: See TracChangeset
for help on using the changeset viewer.