1 #ifndef MINOR_INTERFACE_H 2 #define MINOR_INTERFACE_H 47 const char* algorithm,
const ideal
i,
48 const bool allDifferent);
79 const ideal
i,
const int cacheStrategy,
80 const int cacheN,
const int cacheW,
81 const bool allDifferent);
106 const int k,
const ideal
i,
107 const bool allDifferent);
ideal getMinorIdeal(const matrix m, const int minorSize, const int k, const char *algorithm, const ideal i, const bool allDifferent)
Returns the specified set of minors (= subdeterminantes) of the given matrix.
ideal getMinorIdealHeuristic(const matrix m, const int minorSize, const int k, const ideal i, const bool allDifferent)
Returns the specified set of minors (= subdeterminantes) of the given matrix.
The following sip_sideal structure has many different uses thoughout Singular. Basic use-cases for it...
ideal getMinorIdealCache(const matrix m, const int minorSize, const int k, const ideal i, const int cacheStrategy, const int cacheN, const int cacheW, const bool allDifferent)
Returns the specified set of minors (= subdeterminantes) of the given matrix.