Enumeration Order complexity Equivalency

Details Enumeration Order complexity Equivalency Enumeration Order complexity Equivalency

2010-11-27

arxiv.org/abs/1011.5966v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Enumeration Order complexity Equivalency does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration Order complexity Equivalency, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration Order complexity Equivalency will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-589245