The following pages link to (Q3883493):
Displaying 28 items.
- Multiplication of polynomials modulo \(x^n\) (Q551166) (← links)
- Commutative algebras of minimal rank (Q595370) (← links)
- Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
- Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\) (Q645700) (← links)
- Iterative signal processing for mitigation of analog-to-digital converter clipping distortion in multiband OFDMA receivers (Q693822) (← links)
- Improved upper complexity bounds for the discrete Fourier transform (Q811112) (← links)
- On arithmetical algorithms over finite fields (Q910432) (← links)
- On multiplication in finite fields (Q964921) (← links)
- Special algorithms for convolutions over Galois fields (Q1071810) (← links)
- Haifa 1985 conference on matrix theory (Q1085237) (← links)
- 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\) (Q1110328) (← links)
- The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic (Q1165575) (← links)
- Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
- On fast multiplication of polynomials over arbitrary algebras (Q1186518) (← links)
- Multilinear algebra and parallel programming (Q1186818) (← links)
- Using fast matrix multiplication to find basic solutions (Q1275090) (← links)
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\) (Q1385406) (← links)
- Double coset decompositions and computational harmonic analysis on groups (Q1581065) (← links)
- Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse (Q1819538) (← links)
- Structure of algebras of commutative matrices (Q1906768) (← links)
- Convolution accelerator designs using fast algorithms (Q2004889) (← links)
- A decomposable Winograd method for N-D convolution acceleration in video analysis (Q2054386) (← links)
- A faster algorithm for reducing the computational complexity of convolutional neural networks (Q2283825) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- Improved Three-Way Split Formulas for Binary Polynomial Multiplication (Q2889884) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
- THE BOUNDARY LERCH ZETA-FUNCTION AND SHORT CHARACTER SUMS À LA Y. YAMAMOTO (Q4995437) (← links)
- Deep Convolutional Neural Networks for Image Classification: A Comprehensive Review (Q5382481) (← links)
