Can I read Enumeration Order complexity Equivalency on EtoBox?

Enumeration Order complexity Equivalency by Asaeedi, Saeed; Didehvar, Farzad is a scholarly article available to read on EtoBox.

What is Enumeration Order complexity Equivalency about?

Throughout this article we develop and change the definitions and the ideas in "arXiv:1006.4939", in order to consider the efficiency of functions and complexity time problems. The central idea here is effective enumeration and listing, and efficiency of function which is defined between two sets proposed in basic definitions. More in detail, it might be that h and g were co-order but the velocity of them be different.

Author

Asaeedi, Saeed; Didehvar, Farzad

Published

2010

Language

EN