@article{MAKHILLJEAS20127613350,
    title = {Group Representations and Complexity Theory: A Review},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {7},
    number = {6},
    pages = {418-420},
    year = {2012},
    issn = {1816-949x},
    doi = {jeasci.2012.418.420},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2012.418.420},
    author = {V.},
    keywords = {Theoretical Computer Science,algebraic operations,conjectures,resolution,progress,Group Representation Theory},
    abstract = {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.}
    }