207 citations · 454 across the 17 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013
A Statistical Peek into Average Case Complexity
Niraj Kumar Singh, Soubhik Chakraborty, Dheeresh Kumar Mallick
The present paper gives a statistical adventure towards exploring the average case complexity behavior of computer algorithms. Rather than following the traditional count based ana…
cs.DS2013
An Adaptable Fast Matrix Multiplication Algorithm, Going Beyond the Myth of Decimal War
Niraj Kumar Singh, Soubhik Chakraborty, Dheeresh Kumar Mallick
In this paper we present an adaptable fast matrix multiplication (AFMM) algorithm, for two nxn dense matrices which computes the product matrix with average complexity Tavg(n) = d1…