作者: Weiping Shi
关键词: Average-case complexity 、 Computational complexity theory 、 Worst-case complexity 、 Upper and lower bounds 、 Minification 、 Time complexity 、 Slicing 、 Algorithm 、 Combinatorics 、 Floorplan 、 Mathematics
摘要: The traditional algorithm of L. Stockmeyer (1983) for area minimization slicing floorplans has time (and space) complexity O(n/sup 2/) in the worst case, or O(n log n) balanced slicing. For more than a decade, it is considered best possible. In this paper, we present new worst-case n), where n total number realizations basic blocks, regardless whether not. We also prove /spl Omega/(n lower bound and any algorithm. Therefore, not only finds optimal realization, but an running time.