where we reduce a problem of size $n$ into $a$ problems of size $n/b$ and $a$ and $b$ are integers (1,2,3....). We will show how to solve such recurrences when $g$ is ...

Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations; evaluation of sums; integer functions; elementary number theory; binomial ...

ABSTRACT: We obtain a closed form expression for the joint probability mass function of the occupation times for a Three-State Markov chain. Our representation extends the long-standing result for a ...

If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...

Abstract: In this work, we first introduce a discrete version of generalized Fisher information measure and develop some new results for it. We then propose Jensen-generalized discrete Fisher ...