The following pages link to Shmuel Winograd (Q915377):
Displaying 25 items.
- (Q786508) (redirect page) (← links)
- The multiplicative complexity of certain semilinear systems defined by polynomials (Q786509) (← links)
- On the direct sum conjecture (Q801142) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform (Q1060551) (← links)
- The multiplicative complexity of the discrete Fourier transform (Q1060552) (← 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)
- Direct sums of bilinear algorithms (Q1157377) (← links)
- Hecke's theorem in quadratic reciprocity, finite nilpotent groups and the Cooley-Tukey algorithm (Q1169506) (← links)
- On the complexity of multiplication in finite fields (Q1171378) (← links)
- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u]/\langle{} u^ n \rangle\) (Q1178708) (← links)
- The optimal recovery of smooth functions (Q1229549) (← links)
- On multiplication in algebraic extension fields (Q1256512) (← links)
- On the multiplicative complexity of the discrete Fourier transform (Q1259162) (← links)
- On the algebraic complexity of inner product (Q2548858) (← links)
- On multiplication of 2 \(\times\) 2 matrices (Q2548859) (← links)
- Optimal iterative processes for root-finding (Q2557541) (← links)
- Multiple Input-Output Links in Computer Systems (Q3289378) (← links)
- (Q3309061) (← links)
- A generalization of a theorem of Boolean relation matrices (Q4166859) (← links)
- On the rate of convergence to the neutral attractor of a family of one-dimensional maps (Q5306808) (← links)
- ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS (Q5584335) (← links)
- On the number of multiplications necessary to compute certain functions (Q5584925) (← links)
- Coding for Logical Operations (Q5600643) (← links)
- Fast evaluation of polynomials by rational preparation (Q5648442) (← links)
