{"title":"离散函数表示三元决策图的复杂性","authors":"D. Jankovic, R.S. Stnkovic","doi":"10.1109/TELSKS.2001.954840","DOIUrl":null,"url":null,"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.","PeriodicalId":253344,"journal":{"name":"5th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service. TELSIKS 2001. Proceedings of Papers (Cat. No.01EX517)","volume":"8 10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Complexity of ternary decision diagrams for representation of discrete functions\",\"authors\":\"D. Jankovic, R.S. Stnkovic\",\"doi\":\"10.1109/TELSKS.2001.954840\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":253344,\"journal\":{\"name\":\"5th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service. TELSIKS 2001. Proceedings of Papers (Cat. No.01EX517)\",\"volume\":\"8 10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"5th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service. TELSIKS 2001. Proceedings of Papers (Cat. No.01EX517)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TELSKS.2001.954840\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"5th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service. TELSIKS 2001. Proceedings of Papers (Cat. No.01EX517)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELSKS.2001.954840","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Complexity of ternary decision diagrams for representation of discrete functions
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.