出血
发表于 2025-4-1 05:56:01
Jens Freche,Milan den Heijer,Bastian Wormuth is simple, has a very much simpler analysis and achieves a lower worst case message complexity (less than 1.271. log .+O(.) messages). An additional contribution of this paper is a new perspective on this problem that exhibits its structure thus permitting a better understanding of various message saving mechanisms.