Journal of Engineering and Applied Sciences

Year: 2012
Volume: 7
Issue: 6
Page No. 418 - 420

Group Representations and Complexity Theory: A Review

Authors : V.Srimathi

References

Cohn, H. and C. Umans, 2003. A group-theoretic approach to fast matrix multiplication. Proceedings of the 44th Annual Symposium on Foundations of Computer Science, October 11-14, 2003, USA., pp: 438-449.

Cohn, H., R. Kleinberg, B. Szegedy and C. Umans, 2005. Group-theoretic algorithmsfor matrix multiplication. Proceedings of the 46th Annual IEEE Symposiumon Foundations of Computer Science, October 23-25, 2005, IEEE Computer Security, USA., pp: 379-388.

Kumar, S., 2010. Geometry of orbits of determinants and permanants. http://math.unc.edu/Faculty/kumar/papers/kumar62.pdf.

Rainbolt, J.G. and J.A. Gallian, 2003. Abstract Algebra with GAP: A Manual to be Used with Contemporary Abstract Algebra. 5th Edn., Houghton Mifflin Company, New York..

Serre, J.P., 1977. Linear Representations of Finite Groups. 4th Edn., Springer Verlag, Berlin-Heidelberg, ISBN-13: 9780387901909, Pages: 170.

Strassen, V., 1969. Gaussian elimination is not optimal. Numer. Mathe., 13: 354-356.

Williams, V.V., 2011. Breaking the coppersmith-winograd barrier. http://www.cs.berkeley.edu/~virgi/matrixmult.pdf.

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved