Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with group algebras:
TR10-049 | 24th March 2010
Alexey Pospelov

Bounds for Bilinear Complexity of Noncommutative Group Algebras

Revisions: 1 , Comments: 1

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 >>>

ISSN 1433-8092 | Imprint