References

@conference{Jankovic200117,

title = {Complexity of ternary decision diagrams for representation of discrete functions},

author = {D. Jankovic and R. S. Stnkovic},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84905867979\&doi=10.1109%2fTELSKS.2001.954840\&partnerID=40\&md5=a072ac05efecf89a3df7a189a4545f0a},

doi = {10.1109/TELSKS.2001.954840},

year  = {2001},

date = {2001-01-01},

journal = {5th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service, TELSIKS 2001 - Proceedings of Papers},

volume = {1},

pages = {17 \textendash 20},

publisher = {IEEE Computer Society},

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. © 2001 IEEE.},

keywords = {Binary decision diagrams; Broadcasting; Cables; Decision theory; Decision diagram; Discrete functions; Switching functions},

pubstate = {published},

tppubtype = {conference}

}