The asymptotic complexity of partial sorting -- How to learn large posets by pairwise comparisons

Details The asymptotic complexity of partial sorting -- How to learn large posets by pairwise comparisons The asymptotic complexity of partial sorting -- How to learn large posets by pairwise comparisons

2002-05-06

arxiv.org/abs/math/0205049v1

Mathematics

Combinatorics

Scientific paper

The expected number of pairwise comparisons needed to learn a partial order
on n elements is shown to be at least n*n/4-o(n*n), and an algorithm is given
that needs only n*n/4+o(n*n) comparisons on average. In addition, the optimal
strategy for learning a poset with four elements is presented.

Affiliated with

Also associated with

No associations

Rating

The asymptotic complexity of partial sorting -- How to learn large posets by pairwise comparisons 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 The asymptotic complexity of partial sorting -- How to learn large posets by pairwise comparisons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The asymptotic complexity of partial sorting -- How to learn large posets by pairwise comparisons will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-497298