Faster Polynomial Multiplication via Discrete Fourier Transforms (Q3007620): Difference between revisions

@@ Property / cites work @@
+Q4888749
@@ Property / cites work: Q4888749 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the bounded coefficient complexity of bilinear maps
+Normal rank
@@ Property / cites work @@
+On fast multiplication of polynomials over arbitrary algebras
+Normal rank
@@ Property / cites work @@
+Algebraic complexities and algebraic curves over finite fields
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Machine Calculation of Complex Fourier Series
+Normal rank
@@ Property / cites work @@
+Q5302073
@@ Property / cites work: Q5302073 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549597
@@ Property / cites work: Q3549597 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for polynomial multiplication that does not depend on the ring constants
+Normal rank
@@ Property / cites work @@
+Simple multivariate polynomial multiplication
@@ Property / cites work: Simple multivariate polynomial multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Fast multiplication of polynomials over fields of characteristic 2
+Normal rank
@@ Property / cites work @@
+Fast multiplication of large numbers
@@ Property / cites work: Fast multiplication of large numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027646
@@ Property / cites work: Q4027646 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4047029
@@ Property / cites work: Q4047029 / rank @@
+Normal rank