Changeset 14e634 in git for factory/facFqBivar.h


Ignore:
Timestamp:
Dec 10, 2012, 3:38:49 PM (11 years ago)
Author:
Martin Lee <martinlee84@…>
Branches:
(u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
Children:
b15cf8578937df382dad415dbfdd2229103409bf
Parents:
3e7db4d961b4509d248e12d8e96e2bed08d9cfe8
git-author:
Martin Lee <martinlee84@web.de>2012-12-10 15:38:49+01:00
git-committer:
Martin Lee <martinlee84@web.de>2012-12-12 15:24:58+01:00
Message:
fix: bug in factorization over Q(a)
File:
1 edited

Legend:

Unmodified
Added
Removed
  • factory/facFqBivar.h

    r3e7db4 r14e634  
    585585CFList
    586586factorRecombination (
    587                 CFList& factors,       ///< [in,out] list of lifted factors
    588                                        ///< that are monic wrt Variable (1)
    589                 CanonicalForm& F,      ///< [in,out] poly to be factored
    590                 const CanonicalForm& M,///< [in] Variable (2)^liftBound
    591                 DegreePattern& degs,   ///< [in] degree pattern
    592                 int s,                 ///< [in] algorithm starts checking
    593                                        ///< subsets of size s
    594                 int thres,             ///< [in] threshold for the size of
    595                                        ///< subsets which are checked, for a
    596                                        ///< full factor recombination choose
    597                                        ///< thres= factors.length()/2
    598                 const modpk& b=modpk() ///< [in] coeff bound
     587            CFList& factors,            ///< [in,out] list of lifted factors
     588                                        ///< that are monic wrt Variable (1)
     589            CanonicalForm& F,           ///< [in,out] poly to be factored
     590            const CanonicalForm& M,     ///< [in] Variable (2)^liftBound
     591            DegreePattern& degs,        ///< [in] degree pattern
     592            int s,                      ///< [in] algorithm starts checking
     593                                        ///< subsets of size s
     594            int thres,                  ///< [in] threshold for the size of
     595                                        ///< subsets which are checked, for a
     596                                        ///< full factor recombination choose
     597                                        ///< thres= factors.length()/2
     598            const modpk& b=modpk(),     ///< [in] coeff bound
     599            const CanonicalForm& den= 1 ///< [in] bound on the den if over Q (a)
    599600                    );
    600601
     
    690691        const ExtensionInfo& info, ///< [in] information about extension
    691692        const CanonicalForm& eval, ///< [in] evaluation point
    692         modpk& b                   ///< [in] coeff bound
     693        modpk& b,                  ///< [in] coeff bound
     694        CanonicalForm& den         ///< [in] bound on the den if over Q(a)
    693695                  );
    694696
Note: See TracChangeset for help on using the changeset viewer.