TY  - JOUR
T1  - Group Representations and Complexity Theory: A Review
AU - Srimathi, V. 
JO  - Journal of Engineering and Applied Sciences
VL  - 7
IS  - 6
SP  - 418
EP  - 420
PY  - 2012
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2012.418.420
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2012.418.420
KW  - Theoretical Computer Science
KW  -algebraic operations
KW  -conjectures
KW  -resolution
KW  -progress
KW  -Group Representation Theory
AB  - Establishing lower bounds for standard algebraic operations 
  is one of the most challenging tasks in Theoretical Computer Science. In this 
  study, researchers discuss lower bounds for matrix multiplication. After a historical 
  review of the progress in this problem. Researchers review a recent development 
  highlighting how the techniques of Group Representation Theory have been applied 
  to give a new approach. Infact, this approach has led to two conjectures whose 
  resolution would achieve the ideal bound for matrix multiplication.
ER  -