[17b1f3] | 1 | /*****************************************************************************\ |
---|
| 2 | * Computer Algebra System SINGULAR |
---|
| 3 | \*****************************************************************************/ |
---|
| 4 | /** @file cfModResultant.h |
---|
| 5 | * |
---|
| 6 | * modular resultant algorithm as described by G.E. Collins in "The Calculation |
---|
| 7 | * of multivariate polynomial resultants" |
---|
| 8 | * |
---|
| 9 | * @author Martin Lee |
---|
| 10 | * |
---|
| 11 | * @internal @version \$Id$ |
---|
| 12 | * |
---|
| 13 | **/ |
---|
| 14 | /*****************************************************************************/ |
---|
| 15 | |
---|
| 16 | #ifndef CF_MOD_RESULTANT_H |
---|
| 17 | #define CF_MOD_RESULTANT_H |
---|
| 18 | |
---|
| 19 | #include "canonicalform.h" |
---|
| 20 | |
---|
| 21 | /// modular resultant algorihtm over Fp |
---|
| 22 | /// |
---|
| 23 | /// @return @a resultantFp returns the resultant of A and B wrt. x |
---|
| 24 | CanonicalForm |
---|
| 25 | resultantFp (const CanonicalForm& A,///<[in] some poly |
---|
| 26 | const CanonicalForm& B,///<[in] some poly |
---|
| 27 | const Variable& x, ///<[in] some polynomial variable |
---|
| 28 | bool prob= true ///<[in] if true use probabilistic algorithm |
---|
| 29 | ); |
---|
| 30 | |
---|
| 31 | /// modular resultant algorihtm over Z |
---|
| 32 | /// |
---|
| 33 | /// @return @a resultantZ returns the resultant of A and B wrt. x |
---|
| 34 | CanonicalForm |
---|
| 35 | resultantZ (const CanonicalForm& A, ///<[in] some poly |
---|
| 36 | const CanonicalForm& B, ///<[in] some poly |
---|
| 37 | const Variable& x, ///<[in] some polynomial variable |
---|
| 38 | bool prob= true ///<[in] if true use probabilistic algorithm |
---|
| 39 | ); |
---|
| 40 | |
---|
| 41 | #endif |
---|
| 42 | |
---|