scientific article; zbMATH DE number 7310034
From MaRDI portal
Publication:5150372
zbMath1455.68294MaRDI QIDQ5150372
Sergey B. Gashkov, Igor S. Sergeev
Publication date: 15 February 2021
Full work available at URL: http://mathnet.ru/eng/cheb863
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for computer arithmetic, etc. (65Y04)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on the depth of symmetric Boolean functions
- Even faster integer multiplication
- Complexity and depth of formulas for symmetric Boolean functions
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Comments to my works, written by myself
- On distinguishing prime numbers from composite numbers
- On arithmetical algorithms over finite fields
- New upper bounds on the Boolean circuit complexity of symmetric functions
- Fast Fourier transform and convolution algorithms
- On fast multiplication of polynomials over arbitrary algebras
- Fast multiplication of polynomials over fields of characteristic 2
- On the multiplicative complexity of the discrete Fourier transform
- Shallow circuits and concise formulae for multiple addition and multiplication
- On the real complexity of a complex DFT
- Fast on-line integer multiplication
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- A new matrix approach to real FFTs and convolutions of length \(2^k\)
- Multiplikation großer Zahlen
- Fast multiplication of large numbers
- On fast multiplication of polynomials, the Fourier and Hartley transforms
- Generating and Searching Families of FFT Algorithms
- Faster Binary-Field Multiplication and Faster Binary-Field MACs
- Fast Integer Multiplication Using Modular Arithmetic
- Shimura Modular Curves and Asymptotic Symmetric Tensor Rank of Multiplication in any Finite Field
- On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
- A new truncated fourier transform algorithm
- New algorithms for digital convolution
- Faster Polynomial Multiplication over Finite Fields
- Faster relaxed multiplication
- Faster Integer Multiplication
- Storage Modification Machines
- Complexity problems in computational theory
- Fast Fourier Transforms for Nonequispaced Data
- Discrete Weighted Transforms and Large-Integer Arithmetic
- A Modified Split-Radix FFT With Fewer Arithmetic Operations
- Scaled Radix-2/8 Algorithm for Efficient Computation of Length-$N=2^{m}$ DFTs
- The truncated fourier transform and applications
- Faster integer multiplication using plain vanilla FFT primes
- The Frobenius FFT
- Frobenius Additive Fast Fourier Transform
- Better Circuits for Binary Polynomial Multiplication
- New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
- Additive Fast Fourier Transforms Over Finite Fields
- An Algorithm for the Machine Calculation of Complex Fourier Series
- How Fast Can We Multiply Large Integers on an Actual Computer?
- The Fast Fourier Transform in a Finite Field
- Algebraic complexities and algebraic curves over finite fields
- Faster integer multiplication using short lattice vectors
This page was built for publication: