Title :
Three Variants of the Master Theorem
Author :
Mogos, Andrei-Horia
Author_Institution :
Comput. Sci. Dept., Univ. Politeh. of Bucharest, Bucharest, Romania
Abstract :
The theory of algorithms complexity is of great importance in both theoretical and applied computer science. One of its main topics is the study of the recurrence relations as a way of representing algorithms complexities. In this paper we propose three variants of the Master Theorem, easier to apply than the standard variant. We also provide proofs for the proposed results and a comparative discussion.
Keywords :
computational complexity; theorem proving; algorithm complexity theory; master theorem variant; proof system; recurrence relations; Algorithm design and analysis; Complexity theory; Computer science; Control systems; Educational institutions; Equations; Standards; Master Theorem; complexity notation; limit of a sequence;
Conference_Titel :
Control Systems and Computer Science (CSCS), 2013 19th International Conference on
Conference_Location :
Bucharest
Print_ISBN :
978-1-4673-6140-8
DOI :
10.1109/CSCS.2013.73
