消灭
发表于 2025-3-30 08:27:56
http://reply.papertrans.cn/16/1532/153118/153118_51.png
高贵领导
发表于 2025-3-30 13:48:07
http://reply.papertrans.cn/16/1532/153118/153118_52.png
ALT
发表于 2025-3-30 17:34:45
Formulation of the addition-shift-sequence problem and its complexity,tion, and it will be called the . problem. As a fundamental result on computational complexity, we show that the addition-shift-sequence problem is NP-complete. Then, we show lower and upper bounds of the number of operations for some particular sequence, where some techniques specific to our model are demonstrated.
stress-response
发表于 2025-3-31 00:39:08
http://reply.papertrans.cn/16/1532/153118/153118_54.png
GILD
发表于 2025-3-31 03:25:36
Multi-color routing in the undirected hypercube,y one of the . colors so that the paths of the same color are edge disjoint (each edge of . appears at most once in the paths of each single color). Let .. denote the .-dimensional hypercube, for arbitrary . ≥ 1. We show that a routing problem (.., .) always admits a four-colorable solution when . is a matching, i.e., its maximum degree is one.
分散
发表于 2025-3-31 09:02:43
Competitive source routing on tori and meshes,e system load distribution. The cost we concern about is the maximum load among the edges. We use . to measure the performance of algorithms. We show that the competitive ratio for any algorithm is ,Ω(log .), and we provide an algorithm whose competitive ratio is .(log .).
有角
发表于 2025-3-31 11:31:54
http://reply.papertrans.cn/16/1532/153118/153118_57.png
有法律效应
发表于 2025-3-31 13:34:59
http://reply.papertrans.cn/16/1532/153118/153118_58.png
adduction
发表于 2025-3-31 19:22:54
http://reply.papertrans.cn/16/1532/153118/153118_59.png
Orthodontics
发表于 2025-3-31 23:08:57
http://reply.papertrans.cn/16/1532/153118/153118_60.png