Journal of Engineering and Applied Sciences

107
Views

1
Downloads

Group Representations and Complexity Theory: A Review

V. Srimathi
Page: 418-420 | Received 21 Sep 2022, Published online: 21 Sep 2022

By Research Area

Medicine & Public Health Life Sciences Engineering Mathematics Biomedicine Physics Chemistry Computer Science Earth Sciences Social Sciences Business and Management Psychology Materials Science Economics Education Environment Philosophy Statistics Law Political Science and International Relations Pharmacy Dentistry Energy Linguistics Geography Finance Criminology and Criminal Justice Medicine Cultural and Media Studies History Architecture / Design Literature Biomedical Sciences Religious Studies Education & Language Food Science & Nutrition Public Health

By Volume and Issue

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.

How to cite this article:

V. Srimathi. Group Representations and Complexity Theory: A Review.
DOI: https://doi.org/10.36478/jeasci.2012.418.420
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2012.418.420