文件夹
发表于 2025-3-28 16:04:41
A note on the computational complexity of bracketing and related problems,complete problem. This problem is related to problems on random walks, planar triangulations of convex polygons and to the problem of comparison of two (labeled) rooted trees. The latter problem is studied with the connection to cluster analysis. Finally, some polynomially solvable classes of bracketing problems are obtained.
不法行为
发表于 2025-3-28 19:20:23
http://reply.papertrans.cn/63/6209/620817/620817_42.png
可忽略
发表于 2025-3-28 23:53:04
http://reply.papertrans.cn/63/6209/620817/620817_43.png
Mri485
发表于 2025-3-29 03:58:16
http://reply.papertrans.cn/63/6209/620817/620817_44.png
intuition
发表于 2025-3-29 08:32:26
0302-9743 S ‘88) held at Smolenice Castle (Czechoslovakia), November 14-18, 1988. It is divided into five chapters which approach the three crucial notions of contemporary theoretical computer science - machines, languages, and complexity - from different perspectives. The first chapter contains contributions
interlude
发表于 2025-3-29 13:23:58
http://reply.papertrans.cn/63/6209/620817/620817_46.png
Incisor
发表于 2025-3-29 19:02:38
Conference proceedings 1989d at Smolenice Castle (Czechoslovakia), November 14-18, 1988. It is divided into five chapters which approach the three crucial notions of contemporary theoretical computer science - machines, languages, and complexity - from different perspectives. The first chapter contains contributions dealing w
Creditee
发表于 2025-3-29 20:08:47
6楼
pineal-gland
发表于 2025-3-30 00:27:15
6楼
chastise
发表于 2025-3-30 04:47:18
6楼