Macaulay2 Engine
Loading...
Searching...
No Matches
franzi-gb.cpp File Reference
#include "franzi-brp.hpp"
#include <sys/time.h>
#include <set>
#include <time.h>

Go to the source code of this file.

Classes

class  Pair
 S-pair record for the Franzi boolean Groebner basis algorithm. More...
class  FunctionPair
 Materialised (f, g) pair of BRP polynomials referenced by a Pair index record. More...

Typedefs

typedef std::set< PairPairs

Functions

Pairs makeList (const IntermediateBasis &F, int n)
Pairs makeNewPairs (int newIndex, const IntermediateBasis &F, int n)
bool inList (int i, int j, const Pairs &B, const IntermediateBasis &F)
bool isGoodPair (const Pair &pair, const IntermediateBasis &F, const Pairs &B, int n)
BRP sPolynomial (const Pair &pair, const IntermediateBasis &F, int n)
void cancelLeadTerm (BRP &f, const BRP &g)
IntermediateBasis::const_iterator findDivisor (const BRP &f, const IntermediateBasis &F, const IntermediateBasis::const_iterator itF)
bool reduceLt (BRP &f, const IntermediateBasis &F, const IntermediateBasis::const_iterator itF)
bool reduceTail (BRP &f, const IntermediateBasis &F, const IntermediateBasis::const_iterator itF)
bool reduce (BRP &f, const IntermediateBasis &F, const IntermediateBasis::const_iterator itF)
void reduce (BRP &f, const IntermediateBasis &F)
void rearrangeBasis (IntermediateBasis &F, int nextIndex)
void interreduction (IntermediateBasis &F)
void gb (IntermediateBasis &F, int n)