Efficient Computation of Binomial Coefficients Using Splay Trees
| Autor: | Karthik Radhakrishnan, Aman Kishore Achpal, Vinayshekhar Bannihatti Kumar |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
Pascal's rule Binomial (polynomial) Binomial approximation Splay tree Pascal's triangle Gaussian binomial coefficient symbols.namesake TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION symbols Multinomial theorem Binomial coefficient Mathematics |
| Zdroj: | International Journal on Data Science and Technology. 2:15 |
| ISSN: | 2472-2200 |
| DOI: | 10.11648/j.ijdst.20160201.14 |
| Popis: | Combinatorics is an important branch of mathematics. Binomial coefficients play an important role in the computation of permutations and combinations in mathematics. This paper describes a novel method of computing coefficients using Splay Trees. The performance in terms of space as well as time efficiency is compared, and conclusions on the technique are offered. We show how this technique is particularly effective in the expansion of a binomial expression. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|