轻而薄
发表于 2025-3-23 13:24:40
Best possible bounds on the weighted path length of optimum binary search trees,We derive upper and lower bounds for the weighted path length P. of optimum binary search trees. In particular, 1/log3 H≤P.≤2+H where H is the entropy of the frequency distribution. We also present an approximation algorithm which constructs nearly optimal trees.
Dawdle
发表于 2025-3-23 17:22:21
http://reply.papertrans.cn/17/1662/166182/166182_12.png
几何学家
发表于 2025-3-23 21:20:15
,The complexity of negation-limited networks — A brief survey, term of order n.log.n is saved. However, for sets of lower inversion complexity, no interesting bounds are known on the amount of savings possible. Good upper bounds on the amount of such savings would enable lower bounds on combinational complexity to be concluded from lower bounds on the negation-restricted complexity.
昏睡中
发表于 2025-3-23 22:39:02
http://reply.papertrans.cn/17/1662/166182/166182_14.png
确定
发表于 2025-3-24 02:21:35
http://reply.papertrans.cn/17/1662/166182/166182_15.png
把…比做
发表于 2025-3-24 07:20:16
Langages algebriques deterministes et groupes abeliens,
galley
发表于 2025-3-24 11:40:45
http://reply.papertrans.cn/17/1662/166182/166182_17.png
亲密
发表于 2025-3-24 16:01:37
,Über den mittleren Zeitbedarf bei der LR(k) — Analyse kontextfreier Sprachen,
Decline
发表于 2025-3-24 22:19:53
http://reply.papertrans.cn/17/1662/166182/166182_19.png
玉米棒子
发表于 2025-3-24 23:48:59
The network-complexity of equivalence and other applications of the network complexity,