1 problem

0 votes0 replies0 views
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…
Conjectureopenactive-clustering query-complexity random-partitionsarXiv posted 2 days ago

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