Parameterized Complexity Analysis of Computer Algorithms

The present book makes a statistical assessment of the influence of parameters of input probability distribution on the time complexity of some of the computer algorithms in sequential computing paradigm. Such investigations in parameterized complexity offer a challenging, new and very interesting research area involving extensive statistical modeling given that theoretical analysis in such problems turns out to be complex.