Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations, evaluation of sums, integer functions, elementary number theory, binomial ...
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 ...
This is a preview. Log in through your library . Abstract Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results