Changeset 018577 in git for factory/cf_gcd_smallp.h

Timestamp:

Sep 13, 2010, 5:18:53 PM (14 years ago)

Author:

Martin Lee <martinlee84@…>

Branches:

(u'spielwiese', '4a9821a93ffdc22a6696668bd4f6b8c9de3e6c5f')

Children:

72292fbb6682a392b300d1837489860c3f412907

Parents:

231b0fd0173552d615fba69018a64ff5510211be

Message:

new sparse modular gcd over finite fields, new EZ gcd over finite fields, which is now switched on by default


git-svn-id: file:///usr/local/Singular/svn/trunk@13185 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• factory/cf_gcd_smallp.h (modified) (1 diff)

factory/cf_gcd_smallp.h

@@ -64 +64 @@
 
 CanonicalForm 
-randomIrredpoly (int i, const Variable & x) ;
+randomIrredpoly (int i, const Variable & x);
+
+CanonicalForm 
+sparseGCDFp (const CanonicalForm& F, const CanonicalForm& G,
+             bool& topLevel, CFList& l);
+             
+static inline CanonicalForm sparseGCDFp (const CanonicalForm& A, const CanonicalForm& B)
+{
+  CFList list;
+  bool top_level= true;
+  return sparseGCDFp (A, B, top_level, list);
+}
+
+CanonicalForm 
+sparseGCDFq (const CanonicalForm& F, const CanonicalForm& G, const Variable& alpha, CFList& l,
+             bool& topLevel);
+             
+static inline CanonicalForm sparseGCDFq (const CanonicalForm& A, const CanonicalForm& B, const Variable& alpha)
+{
+  CFList list;
+  bool top_level= true;
+  return sparseGCDFq (A, B, alpha, list, top_level);
+}
+
+/// Extended Zassenhaus GCD over finite fields described in "Algorithms for 
+/// Computer Algebra" by Geddes, Czapor & Labahn
+CanonicalForm EZGCD_P (const CanonicalForm& F, const CanonicalForm& G);
+
+/// pseudo remainder GCD over finite fields
+CanonicalForm
+gcd_poly_p( const CanonicalForm & f, const CanonicalForm & g);
+
+CanonicalForm
+gcd_univar_ntlp( const CanonicalForm & F, const CanonicalForm & G );
+
+
 #endif