All reports by Author Alexey Pospelov:

__
TR10-152
| 6th October 2010
__

Alexey Pospelov#### Faster Polynomial Multiplication via Discrete Fourier Transforms

__
TR10-049
| 24th March 2010
__

Alexey Pospelov#### Bounds for Bilinear Complexity of Noncommutative Group Algebras

Revisions: 1
,
Comments: 1

Alexey Pospelov

We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for multiplication of polynomials over fields supporting DFTs of large smooth orders, SchÃ¶nhage-Strassen's algorithm over arbitrary fields of characteristic different ... more >>>

Alexey Pospelov

We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show nontrivial lower bounds for the rest of the group algebras. These lower bounds are built on the ... more >>>