#include <kernel/mod2.h>
#include "gms.h"
#include <coeffs/numbers.h>
#include <kernel/polys.h>
#include "ipid.h"
Go to the source code of this file.
Definition at line 22 of file gms.cc.
void id_Normalize(ideal I, const ring r)
normialize all polys in id
#define pLmDivisibleBy(a, b)
like pDivisibleBy, except that it is assumed that a!=NULL, b!=NULL
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define pGetExp(p, i)
Exponent.
D(ideal gnc_gr_bba(const ideal, const ideal, const intvec *, const intvec *, kStrategy, const ring _currRing)) D(ideal gnc_gr_mora(const ideal
Modified Plural's Buchberger's algorithmus.
void idDelete(ideal *h, ring r=currRing)
delete an ideal
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL ...
INLINE_THIS void Init(int l=0)
matrix mpNew(int r, int c)
create a r x c zero-matrix
ideal idInit(int idsize, int rank)
#define MATELEM(mat, i, j)
Definition at line 102 of file gms.cc.
133 WerrorS(
"<ideal>,<ideal>,<matrix>,<int>,<int> expected");
const const intvec const intvec const ring _currRing const const intvec const intvec const ring _currRing int
void WerrorS(const char *s)
D(ideal gnc_gr_bba(const ideal, const ideal, const intvec *, const intvec *, kStrategy, const ring _currRing)) D(ideal gnc_gr_mora(const ideal
Modified Plural's Buchberger's algorithmus.
lists gmsNF(ideal p, ideal g, matrix B, int D, int K)