scientific article
From MaRDI portal
Publication:3883493
zbMath0441.68045MaRDI QIDQ3883493
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
discrete Fourier transformbilinear formsalgebraic complexitycyclic convolutionFIR filtersproduct of polynomialsproduct of polynomials modulo a polynomial
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items (39)
Improved Three-Way Split Formulas for Binary Polynomial Multiplication ⋮ Haifa 1985 conference on matrix theory ⋮ Some basic information on information-based complexity theory ⋮ Structure of algebras of commutative matrices ⋮ Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u/<Q(u)^{\ell}>\), \(\ell >1\)] ⋮ Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness ⋮ Commutative algebras of minimal rank ⋮ Automatic derivation and implementation of fast convolution algorithms ⋮ Algorithms, complexity and discreteness criteria in \(PSL(2,C)\) ⋮ On the Algorithmic Complexity of Digital Image Processing Filters with Winograd Calculations ⋮ Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18 ⋮ On arithmetical algorithms over finite fields ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\) ⋮ The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic ⋮ Fast matrix multiplication without APA-algorithms ⋮ Deep Convolutional Neural Networks for Image Classification: A Comprehensive Review ⋮ A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes ⋮ Derivation and Analysis of Fast Bilinear Algorithms for Convolution ⋮ On fast multiplication of polynomials over arbitrary algebras ⋮ Multilinear algebra and parallel programming ⋮ Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors ⋮ Iterative signal processing for mitigation of analog-to-digital converter clipping distortion in multiband OFDMA receivers ⋮ On multiplication in finite fields ⋮ Convolution accelerator designs using fast algorithms ⋮ Multiplication of polynomials modulo \(x^n\) ⋮ A faster algorithm for reducing the computational complexity of convolutional neural networks ⋮ Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$ ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ A decomposable Winograd method for N-D convolution acceleration in video analysis ⋮ Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse ⋮ Using fast matrix multiplication to find basic solutions ⋮ Code Generation for Polynomial Multiplication ⋮ On evaluating multivariate polynomials over finite fields ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines ⋮ THE BOUNDARY LERCH ZETA-FUNCTION AND SHORT CHARACTER SUMS À LA Y. YAMAMOTO ⋮ Double coset decompositions and computational harmonic analysis on groups ⋮ Improved upper complexity bounds for the discrete Fourier transform ⋮ Special algorithms for convolutions over Galois fields
This page was built for publication:
