A model for set theoretic analysis of algorithm with asymtotic perspectives

Author

Rahman, L. ; Khan, Md Shafiul Alam ; Kabir, A. ; Miah, Md Sipon

fYear

2013

fDate

17-18 May 2013

Firstpage

1

Lastpage

6

Abstract

It has sufficient scope to research in the area of complexity domain. In this paper, we proposed a novel model that is drawn to well understand asymtotic notations. In a novel model using a new Z-domain terminology is to easily analysis of asymtotic notations for set theoretic. Also, the impact of Θ (Sandwidtch or Cap theta) on transitivity and symmetry principal are analysis in the proposed model. It is also shown that algorithm performance needs to be examined for interval of n value as it does not depends only on significant terms of complexity function.

Keywords

computational complexity; set theory; Z-domain terminology; asymtotic notations; asymtotic perspectives; complexity domain; set theoretic; set theoretic analysis; symmetry principal; transitivity principal; Algorithm design and analysis; Analytical models; Approximation methods; Complexity theory; Educational institutions; Information technology; Mathematical model; Asymtotic notations; a novel model; asymtotic distance; complexity domain; symmetric; transitivity;

fLanguage

English

Publisher

ieee

Conference_Titel

Informatics, Electronics & Vision (ICIEV), 2013 International Conference on

Conference_Location

Dhaka

Print_ISBN

978-1-4799-0397-9

Type

conf

DOI

10.1109/ICIEV.2013.6572596

Filename

6572596