没有准备 发表于 2025-4-1 03:07:48

http://reply.papertrans.cn/24/2348/234776/234776_61.png

充足 发表于 2025-4-1 08:35:39

http://reply.papertrans.cn/24/2348/234776/234776_62.png

grudging 发表于 2025-4-1 13:47:48

http://reply.papertrans.cn/24/2348/234776/234776_63.png

Inveterate 发表于 2025-4-1 15:24:52

http://reply.papertrans.cn/24/2348/234776/234776_64.png

Adherent 发表于 2025-4-1 20:24:07

Thermodynamik der Verbrennungskraftmaschinetimal .-time algorithm, improving the previous . bound by Dom . Our improvement is obtained by presenting a new representation of a dense directed graph, which may be of independent interest. For the second problem, we give an .-time algorithm, improving the previous .(|..||.| + |..||.| + |.|.) bound by Chang .
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: Computing and Combinatorics; 18th Annual Internat Joachim Gudmundsson,Julián Mestre,Taso Viglas Conference proceedings 2012 Springer-Verlag