Title :
Complexity of ternary decision diagrams for representation of discrete functions
Author :
Jankovic, Dragan ; Stnkovic, R.S.
Author_Institution :
Fac. of Electron. Eng., Nis Univ., Serbia
fDate :
6/23/1905 12:00:00 AM
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
Keywords :
computational complexity; decision diagrams; switching functions; TDD; discrete function representation; switching functions; ternary decision diagram complexity; two-valued variables; Arithmetic; Binary decision diagrams; Binary trees; Boolean functions; Circuit synthesis; Circuit testing; Data structures; Decision trees; Logic design; Switching circuits;
Conference_Titel :
Telecommunications in Modern Satellite, Cable and Broadcasting Service, 2001. TELSIKS 2001. 5th International Conference on
Conference_Location :
Nis
Print_ISBN :
0-7803-7228-X
DOI :
10.1109/TELSKS.2001.954840
