Q5150372 (Q5150372): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3703780
@@ Property / cites work: Q3703780 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692998
@@ Property / cites work: Q4692998 / rank @@
+Normal rank
@@ Property / cites work @@
+On fast multiplication of polynomials, the Fourier and Hartley transforms
+Normal rank
@@ Property / cites work @@
+On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
+Normal rank
@@ Property / cites work @@
+Q3115681
@@ Property / cites work: Q3115681 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4346406
@@ Property / cites work: Q4346406 / rank @@
+Normal rank
@@ Property / cites work @@
+Comments to my works, written by myself
@@ Property / cites work: Comments to my works, written by myself / rank @@
+Normal rank
@@ Property / cites work @@
+Q4344097
@@ Property / cites work: Q4344097 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Fourier transform and convolution algorithms
@@ Property / cites work: Fast Fourier transform and convolution algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3340780
@@ Property / cites work: Q3340780 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5150442
@@ Property / cites work: Q5150442 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds on the depth of symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+Complexity and depth of formulas for symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+On the real complexity of a complex DFT
@@ Property / cites work: On the real complexity of a complex DFT / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity problems in computational theory
@@ Property / cites work: Complexity problems in computational theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5601777
@@ Property / cites work: Q5601777 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3050319
@@ Property / cites work: Q3050319 / rank @@
+Normal rank
@@ Property / cites work @@
+On distinguishing prime numbers from composite numbers
+Normal rank
@@ Property / cites work @@
+New algorithms for digital convolution
@@ Property / cites work: New algorithms for digital convolution / rank @@
+Normal rank
@@ Property / cites work @@
+A new truncated fourier transform algorithm
@@ Property / cites work: A new truncated fourier transform algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Shimura Modular Curves and Asymptotic Symmetric Tensor Rank of Multiplication in any Finite Field
+Normal rank
@@ Property / cites work @@
+Q3615926
@@ Property / cites work: Q3615926 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Binary-Field Multiplication and Faster Binary-Field MACs
+Normal rank
@@ Property / cites work @@
+On arithmetical algorithms over finite fields
@@ Property / cites work: On arithmetical algorithms over finite fields / rank @@
+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 @@
+Discrete Weighted Transforms and Large-Integer Arithmetic
+Normal rank
@@ Property / cites work @@
+Fast Integer Multiplication Using Modular Arithmetic
+Normal rank
@@ Property / cites work @@
+New upper bounds on the Boolean circuit complexity of symmetric functions
+Normal rank
@@ Property / cites work @@
+Fast Fourier Transforms for Nonequispaced Data
@@ Property / cites work: Fast Fourier Transforms for Nonequispaced Data / rank @@
+Normal rank
@@ Property / cites work @@
+Better Circuits for Binary Polynomial Multiplication
+Normal rank
@@ Property / cites work @@
+Fast on-line integer multiplication
@@ Property / cites work: Fast on-line integer multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Integer Multiplication
@@ Property / cites work: Faster Integer Multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+How Fast Can We Multiply Large Integers on an Actual Computer?
+Normal rank
@@ Property / cites work @@
+Additive Fast Fourier Transforms Over Finite Fields
+Normal rank
@@ Property / cites work @@
+Q4227316
@@ Property / cites work: Q4227316 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4248250
@@ Property / cites work: Q4248250 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3272860
@@ Property / cites work: Q3272860 / rank @@
+Normal rank
@@ Property / cites work @@
+Even faster integer multiplication
@@ Property / cites work: Even faster integer multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Polynomial Multiplication over Finite Fields
+Normal rank
@@ Property / cites work @@
+Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
+Normal rank
@@ Property / cites work @@
+Faster integer multiplication using short lattice vectors
+Normal rank
@@ Property / cites work @@
+Faster integer multiplication using plain vanilla FFT primes
+Normal rank
@@ Property / cites work @@
+Generating and Searching Families of FFT Algorithms
+Normal rank
@@ Property / cites work @@
+The truncated fourier transform and applications
@@ Property / cites work: The truncated fourier transform and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Faster relaxed multiplication
@@ Property / cites work: Faster relaxed multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+The Frobenius FFT
@@ Property / cites work: The Frobenius FFT / rank @@
+Normal rank
@@ Property / cites work @@
+A Modified Split-Radix FFT With Fewer Arithmetic Operations
+Normal rank
@@ Property / cites work @@
+Frobenius Additive Fast Fourier Transform
@@ Property / cites work: Frobenius Additive Fast Fourier Transform / rank @@
+Normal rank
@@ Property / cites work @@
+A new matrix approach to real FFTs and convolutions of length \(2^k\)
+Normal rank
@@ Property / cites work @@
+Q4055196
@@ Property / cites work: Q4055196 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036708
@@ Property / cites work: Q4036708 / rank @@
+Normal rank
@@ Property / cites work @@
+Shallow circuits and concise formulae for multiple addition and multiplication
+Normal rank
@@ Property / cites work @@
+New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
+Normal rank
@@ Property / cites work @@
+The Fast Fourier Transform in a Finite Field
@@ Property / cites work: The Fast Fourier Transform in a Finite Field / rank @@
+Normal rank
@@ Property / cites work @@
+Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
+Normal rank
@@ Property / cites work @@
+Multiplikation großer Zahlen
@@ Property / cites work: Multiplikation großer Zahlen / rank @@
+Normal rank
@@ Property / cites work @@
+Fast multiplication of large numbers
@@ Property / cites work: Fast multiplication of large numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Fast multiplication of polynomials over fields of characteristic 2
+Normal rank
@@ Property / cites work @@
+Storage Modification Machines
@@ Property / cites work: Storage Modification Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Q3325040
@@ Property / cites work: Q3325040 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4306894
@@ Property / cites work: Q4306894 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+On the multiplicative complexity of the discrete Fourier transform
+Normal rank
@@ Property / cites work @@
+Scaled Radix-2/8 Algorithm for Efficient Computation of Length-$N=2^{m}$ DFTs
+Normal rank