Complexity of ternary decision diagrams for representation of discrete functions

5th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service. TELSIKS 2001. Proceedings of Papers (Cat. No.01EX517) Pub Date : 2001-09-19 DOI:10.1109/TELSKS.2001.954840

D. Jankovic, R.S. Stnkovic

引用次数: 0

Abstract

We discuss the complexity of different bit-level and word-level ternary decision diagrams (TDDs) for the representation of discrete functions of two-valued variables, including switching functions as a particular example.

查看原文本刊更多论文

离散函数表示三元决策图的复杂性

我们讨论了二值变量离散函数表示的不同位级和字级三元决策图(tdd)的复杂性，包括交换函数作为一个特殊的例子。

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

求助全文

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

来源期刊

5th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service. TELSIKS 2001. Proceedings of Papers (Cat. No.01EX517)

自引率

0.00%

发文量