{"title":"关于不接合的盖和ROBDD尺寸","authors":"E. Dubrova, D.M. Miller","doi":"10.1109/PACRIM.1999.799502","DOIUrl":null,"url":null,"abstract":"The relation between the number of nodes in a ROBDD and the number of implicants in the disjoint cover of the function represented by that ROBDD is studied. We identify a class of functions for which there are disjoint covers such that a cover of a larger size can be represented by a ROBDD with a smaller number of nodes. This shows that the size of a ROBDD is not a monotonically increasing function of the size of the disjoint cover.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"On disjoint covers and ROBDD size\",\"authors\":\"E. Dubrova, D.M. Miller\",\"doi\":\"10.1109/PACRIM.1999.799502\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The relation between the number of nodes in a ROBDD and the number of implicants in the disjoint cover of the function represented by that ROBDD is studied. We identify a class of functions for which there are disjoint covers such that a cover of a larger size can be represented by a ROBDD with a smaller number of nodes. This shows that the size of a ROBDD is not a monotonically increasing function of the size of the disjoint cover.\",\"PeriodicalId\":176763,\"journal\":{\"name\":\"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.1999.799502\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1999.799502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The relation between the number of nodes in a ROBDD and the number of implicants in the disjoint cover of the function represented by that ROBDD is studied. We identify a class of functions for which there are disjoint covers such that a cover of a larger size can be represented by a ROBDD with a smaller number of nodes. This shows that the size of a ROBDD is not a monotonically increasing function of the size of the disjoint cover.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
