Query complexity of membership comparabl
β
Till Tantau
π
Article
π
2003
π
Elsevier Science
π
English
β 217 KB
This paper investigates how many queries to k-membership comparable sets are needed in order to decide all (k + 1)-membership comparable sets. For k ΒΏ 2 this query complexity is at least linear and at most cubic. As a corollary, we obtain that more languages are O(log n)-membership comparable than t