Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds
DGX agentarXiv:2608.02176v1 Announce Type: cross Abstract: We study the round complexity of learning a hidden partition P of an n-element universe using PAIR queries: PAIR(x,y) tells us whether x and y belong