A T-decomposition algorithm with O(n log n) time and space complexity
A T-decomposition algorithm with O(n log n) time and space complexity
复制标题
时间和空间复杂度为 O(n log n) 的 T 分解算法
DOI：
10.1109/isit.2005.1523285
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
U. Speidel
中科院分区：
文献类型：
--
作者：
Jia Yang;U. Speidel
T-decomposition maps a finite string into a series of parameters for a recursive string construction algorithm. Initially developed for the communication of coding trees (M. R. Titchener, June 1996), (U. Guenther, Feb. 2001), T-decomposition has since been studied within the context of information measures. This involves the parsing of potentially very large strings, which in turn requires algorithms with good time complexity. This paper presents a T-decomposition algorithm with O(n log n) time and space complexity
