The following pages link to (Q3309061):
Displaying 10 items.
- On the arithmetic complexity of matrix Kronecker powers (Q594594) (← links)
- Structure and arithmetic complexity of products and inverses of Toeplitz matrices (Q755830) (← links)
- Ring structures and the discrete Fourier transform (Q1076504) (← links)
- On the complexity of computing bilinear forms with \(\{0,1\}\) constants (Q1144927) (← links)
- Matrix displacement decompositions and applications to Toeplitz linear systems (Q1375094) (← links)
- The multiplicative complexity of discrete cosine transforms (Q1802353) (← links)
- Multiplicative characters and the discrete Fourier transform (Q1819920) (← links)
- Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations (Q1823640) (← links)
- Matrix decompositions using displacement rank and classes of commutative matrix algebras (Q1902113) (← links)
- Algebraic complexities and algebraic curves over finite fields (Q5903919) (← links)
