Titlebook: Machines, Languages, and Complexity; 5th International Me J. Dassow,J. Kelemen Conference proceedings 1989 Springer-Verlag Berlin Heidelber

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-3-28 19:20:23

只看該作者 · 發(fā)表于 2025-3-28 23:53:04

只看該作者 · 發(fā)表于 2025-3-29 03:58:16

只看該作者 · 發(fā)表于 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

只看該作者 · 發(fā)表于 2025-3-29 13:23:58

只看該作者 · 發(fā)表于 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

只看該作者 · 發(fā)表于 2025-3-29 20:08:47

6樓

只看該作者 · 發(fā)表于 2025-3-30 00:27:15

6樓

只看該作者 · 發(fā)表于 2025-3-30 04:47:18

6樓

		自動登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經(jīng)驗總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學	Yale Uni.	Stanford Uni.
\|Archiver\|手機版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 12:09
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved