The following pages link to Ephraim Feig (Q801141):
Displayed 21 items.
- On the direct sum conjecture (Q801142) (← links)
- Item:Q801141 (redirect page) (← links)
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform (Q1060551) (← links)
- The multiplicative complexity of the discrete Fourier transform (Q1060552) (← links)
- Direct sums of bilinear algorithms (Q1157377) (← links)
- The uniform memory hierarchy model of computation (Q1333430) (← links)
- On algebras related to the discrete cosine transform (Q1372961) (← links)
- The multiplicative complexity of discrete cosine transforms (Q1802353) (← links)
- (Q3031435) (← links)
- Certain systems of bilinear forms whose minimal algorithms are all quadratic (Q3667942) (← links)
- New algorithms for the multidimensional discrete Fourier transform (Q3678628) (← links)
- Inversion of an integral transform associated with tomography in radar detection (Q3775999) (← links)
- Tomographic methods in range-Doppler radar (Q3788474) (← links)
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (Q3814803) (← links)
- On systems of bilinear forms whose minimal division-free algorithms are all bilinear (Q3932296) (← links)
- (Q3977599) (← links)
- On the multiplicative complexity of discrete cosine transforms (Q4014159) (← links)
- Fast algorithms for the discrete cosine transform (Q4031486) (← links)
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures (Q4034618) (← links)
- Modified FFTs for Fused Multiply-Add Architectures (Q4293974) (← links)
- Minimal algorithms for bilinear forms may have divisions (Q4747507) (← links)