Empirical O(n2) Complexity is Convincingly Gettable with Two Dense Matrices in nxn Matrix Multiplication!

By Suman Kumar Sourabh and Soubhik Chakraborty.

Abstract: The present paper shows that Empirical O(n2) Complexity is Convincingly gettable with two dense matrices in nxn matrix multiplication.

Key Words: Amir Schoor's Algorithm, Sparse matrices, Dense matrices, Average Case Complexity

Suman Kumar Sourabh, sourabh.suman@rediffmail.com
Soubhik Chakraborty, soubhikc@yahoo.co.in

Editor: R. G. Graf, rgraf@sunstroke.sdsu.edu

READING THE ARTICLE: You can read the article in portable document (.pdf) format (44839 bytes.)

NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.

This page has been accessed 2323 times since July 24, 2006.

Return to the InterStat Home Page.