Changeset 36ef97a in git for factory/cfNewtonPolygon.h


Ignore:
Timestamp:
Feb 28, 2013, 12:27:27 PM (10 years ago)
Author:
Martin Lee <martinlee84@…>
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '2234726c50d679d6664181a5c72f75a6fd64a787')
Children:
f224fda57b6b8846990a1284ec08a294e5b2f0f7
Parents:
160ec65155bebf896fb6d52bbe233c0c557a8c0e
git-author:
Martin Lee <martinlee84@web.de>2013-02-28 12:27:27+01:00
git-committer:
Martin Lee <martinlee84@web.de>2013-05-02 11:42:35+02:00
Message:
chg: added absolute irreducibility test
File:
1 edited

Legend:

Unmodified
Added
Removed
  • factory/cfNewtonPolygon.h

    r160ec6 r36ef97a  
    7474                   );
    7575
     76/// absolute irreducibility test as described in "Modular Las Vegas Algorithms
     77/// for Polynomial Absolute Factorization" by C. Bertone, G. Cheze, A. Galligo
     78///
     79/// @return true if F satisfies condition (C) from the above paper and thus
     80/// is absolutely irreducible, false otherwise
     81bool
     82absIrredTest (const CanonicalForm& F ///< [in] a bivariate polynomial
     83                                     ///< irreducible over ground field
     84             );
     85
     86//TODO add modular test from "Modular Las Vegas Algorithms
     87// for Polynomial Absolute Factorization" by C. Bertone, G. Cheze, A. Galligo
     88
    7689#ifdef HAVE_NTL
    7790/// Algorithm 5 as described in Convex-Dense Bivariate Polynomial Factorization
Note: See TracChangeset for help on using the changeset viewer.