scientific article; zbMATH DE number 7310092

zbMath1477.68108MaRDI QIDQ5150442

Igor S. Sergeev

Publication date: 15 February 2021

Full work available at URL: http://mathnet.ru/eng/pdm347

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitydiscrete Fourier transformdepthmultiplicationarithmetic circuitsmemory size

Mathematics Subject Classification ID

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 (2)

An in-place truncated Fourier transform ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: