Default 发表于 2025-3-30 08:33:26

http://reply.papertrans.cn/63/6262/626137/626137_51.png

暂时别动 发表于 2025-3-30 13:03:54

On Optimal Merging Networksused. For other cases where . ≤ 4, the optimality of Batcher’s (.,.)-merging networks has been proved. So we can conclude that Batcher’s odd-even merge yields optimal (.,.)-merging networks for every . ≤ 4 and for every .. The crucial part of the proof is characterizing the structure of optimal (2,.

Confirm 发表于 2025-3-30 16:37:21

http://reply.papertrans.cn/63/6262/626137/626137_53.png

变化 发表于 2025-3-30 23:45:11

http://reply.papertrans.cn/63/6262/626137/626137_54.png

MURAL 发表于 2025-3-31 02:34:33

http://reply.papertrans.cn/63/6262/626137/626137_55.png

向前变椭圆 发表于 2025-3-31 07:56:45

http://reply.papertrans.cn/63/6262/626137/626137_56.png

消耗 发表于 2025-3-31 12:33:58

http://reply.papertrans.cn/63/6262/626137/626137_57.png

ensemble 发表于 2025-3-31 14:41:01

http://reply.papertrans.cn/63/6262/626137/626137_58.png

激怒某人 发表于 2025-3-31 21:10:32

http://reply.papertrans.cn/63/6262/626137/626137_59.png

掺假 发表于 2025-3-31 22:45:47

http://reply.papertrans.cn/63/6262/626137/626137_60.png
页: 1 2 3 4 5 [6] 7
查看完整版本: Titlebook: Mathematical Foundations of Computer Science 2003; 28th International S Branislav Rovan,Peter Vojtáš Conference proceedings 2003 Springer-V