My Project
Loading...
Searching...
No Matches
cfModResultant.h
Go to the documentation of this file.
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
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/*BEGINPUBLIC*/
30/// modular resultant algorihtm over Z
31///
32/// @return @a resultantZ returns the resultant of A and B wrt. x
34resultantZ (const CanonicalForm& A, ///<[in] some poly
35 const CanonicalForm& B, ///<[in] some poly
36 const Variable& x, ///<[in] some polynomial variable
37 bool prob= true ///<[in] if true use probabilistic algorithm
38 );
39/*ENDPUBLIC*/
40
41#endif
42
Header for factory's main class CanonicalForm.
Variable x
Definition: cfModGcd.cc:4082
CanonicalForm resultantZ(const CanonicalForm &A, const CanonicalForm &B, const Variable &x, bool prob=true)
modular resultant algorihtm over Z
CanonicalForm resultantFp(const CanonicalForm &A, const CanonicalForm &B, const Variable &x, bool prob=true)
modular resultant algorihtm over Fp
factory's main class
Definition: canonicalform.h:86
factory's class for variables
Definition: variable.h:33
b *CanonicalForm B
Definition: facBivar.cc:52
#define A
Definition: sirandom.c:24