A fast algorithm for the disjunctive decomposition of m-valued functions. II. Time complexity analysis

[1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic Pub Date : 1993-05-24 DOI:10.1109/ISMVL.1993.289570

Sami B. Abugharbieh, Samuel C. Lee

引用次数: 0

Abstract

For part I see ibid., p.118-25. The time complexity of the fast algorithm for the disjunctive decomposition of m-valued functions, proposed in part I is studied. A probabilistic approach is used to estimate the time complexity for random m-valued functions, where several statistical properties of such functions are obtained and used in the analysis. It is shown that the time complexity for random functions is of the order of (nm)/sup 3/. In the case in which a random function has a single disjunctive decomposition, the time complexity becomes of the order n/sup 3/m/sup n/. The algorithm was simulated on a digital computer. The experimental results are in agreement with the theoretical predictions.<>

查看原文本刊更多论文

m值函数析取分解的一种快速算法。2。时间复杂度分析

第一部分见同上，第118-25页。研究了第一部分中提出的m值函数析取分解快速算法的时间复杂度。采用概率方法估计随机m值函数的时间复杂度，得到了随机m值函数的一些统计性质，并应用于分析。结果表明，随机函数的时间复杂度约为(nm)/sup /。当随机函数只有一次析取分解时，其时间复杂度为n/sup 3/m/sup n/阶。该算法在数字计算机上进行了仿真。实验结果与理论预测一致。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量