opt: p_Mult_q heuristic

Singular · May 2, 2024 · c5facdf · c5facdf
1 parent 5f3d143
commit c5facdf
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/libpolys/polys/operations/p_Mult_q.cc b/libpolys/polys/operations/p_Mult_q.cc
@@ -304,7 +304,7 @@ poly _p_Mult_q_Normal(poly p, poly q, const int copy, const ring r)
 #define MIN_LENGTH_FACTORY 300
 #define MIN_FLINT_QQ 80
 #define MIN_FLINT_Zp 85
-#define MIN_FLINT_Z 50
+#define MIN_FLINT_Z 100
 
 /// Returns:  p * q,
 /// Destroys: if !copy then p, q

diff --git a/libpolys/polys/operations/p_Mult_q.h b/libpolys/polys/operations/p_Mult_q.h
@@ -18,7 +18,7 @@
 // Use buckets if min(pLength(p), pLength(q)) >= MIN_LENGTH_BUCKET
 // Not thoroughly tested what is best
 #ifndef MIN_LENGTH_BUCKET
-#define MIN_LENGTH_BUCKET 25
+#define MIN_LENGTH_BUCKET 30
 #endif
 
 ///  return TRUE and lp == pLength(p), lq == pLength(q),