Virual Oral Presentation Slide by Slide

IEEE/ICACT20220156 Slide.37        [Big Slide]	Oral Presentation
	Similarly, we computed Big-O for proposed algorithm and for worst case scenario, complexity reduced to quadratic (O(U2)) as compared to the cubic (O(U3)) complexity of conventional algorithm of dominance based rough set theory.

[Go to Next Slide]

Select Voice: Virtual Oral Presentation!!