Parameterized Complexity Analysis of Computer Algorithms

ISBN-13: 9783330347441 / Angielski / Miękka / 2017 / 164 str.

Mita Pal; Soubhik Chakraborty; N. C. Mahanti

Opis

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.

O autorze

Dr. Mita Pal, MCA, completed her PhD in the area of parameterized complexity under the joint guidance of Prof. Dr. Soubhik Chakraborty and Prof. Dr. N. C. Mahanti, from department of Mathematics, Birla Institute of Technology, Mesra, Ranchi, India The present book is the fruitful outcome of her doctoral dissertation.