1 problem

Lutz–De Panafieu–Stein–Scott active clustering query complexity conjecture
Active clustering query complexity conjecture. The average number of membership queries required is $(1+o(1))\sum_{i=1}^k i p_i n$ . This conjecture concerns the optimal average que…
openFrom papersactive-clustering query-complexity random-partitions
0 responses
6

Lutz–De Panafieu–Stein–Scott active clustering query complexity conjecture