Publication:5150442
From MaRDI portal
zbMath1477.68108MaRDI QIDQ5150442
Publication date: 15 February 2021
Full work available at URL: http://mathnet.ru/eng/pdm347
Symbolic computation and algebraic computation (68W30) Numerical methods for discrete and fast Fourier transforms (65T50) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items
Cites Work
- On fast multiplication of polynomials over arbitrary algebras
- Fast multiplication of polynomials over fields of characteristic 2
- The probability to select the correct model using likelihood-ratio based criteria in choosing between two nested models of which the more extended one is true
- An in-place truncated fourier transform and applications to polynomial multiplication
- Discrete Weighted Transforms and Large-Integer Arithmetic
- The truncated fourier transform and applications
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item