source: git/factory/cfModResultant.h @ 72bfc8

jengelh-datetimespielwiese
Last change on this file since 72bfc8 was 72bfc8, checked in by Martin Lee <martinlee84@…>, 11 years ago
chg: deleted @internal
  • Property mode set to 100644
File size: 1.3 KB
Line 
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 **/
12/*****************************************************************************/
13
14#ifndef CF_MOD_RESULTANT_H
15#define CF_MOD_RESULTANT_H
16
17#include "canonicalform.h"
18
19/// modular resultant algorihtm over Fp
20///
21/// @return @a resultantFp returns the resultant of A and B wrt. x
22CanonicalForm
23resultantFp (const CanonicalForm& A,///<[in] some poly
24             const CanonicalForm& B,///<[in] some poly
25             const Variable& x,     ///<[in] some polynomial variable
26             bool prob= true        ///<[in] if true use probabilistic algorithm
27            );
28
29/// modular resultant algorihtm over Z
30///
31/// @return @a resultantZ returns the resultant of A and B wrt. x
32CanonicalForm
33resultantZ (const CanonicalForm& A, ///<[in] some poly
34            const CanonicalForm& B, ///<[in] some poly
35            const Variable& x,      ///<[in] some polynomial variable
36            bool prob= true         ///<[in] if true use probabilistic algorithm
37           );
38
39#endif
40
Note: See TracBrowser for help on using the repository browser.