{"title":"一类布尔方程的解","authors":"J. Tucker, M. Tapia","doi":"10.1109/SECON.1995.513067","DOIUrl":null,"url":null,"abstract":"New methods of solving a frequently encountered class of two-valued Boolean equations are presented. These methods are more direct and simpler to apply than existing techniques. Karnaugh maps employing the paradigm that distinguishes between \"don't-care\" and \"can't-happen\" conditions are used to present the methods. The techniques can easily be computerized.","PeriodicalId":334874,"journal":{"name":"Proceedings IEEE Southeastcon '95. Visualize the Future","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Solution of a class of Boolean equations\",\"authors\":\"J. Tucker, M. Tapia\",\"doi\":\"10.1109/SECON.1995.513067\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"New methods of solving a frequently encountered class of two-valued Boolean equations are presented. These methods are more direct and simpler to apply than existing techniques. Karnaugh maps employing the paradigm that distinguishes between \\\"don't-care\\\" and \\\"can't-happen\\\" conditions are used to present the methods. The techniques can easily be computerized.\",\"PeriodicalId\":334874,\"journal\":{\"name\":\"Proceedings IEEE Southeastcon '95. Visualize the Future\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Southeastcon '95. Visualize the Future\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.1995.513067\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE Southeastcon '95. Visualize the Future","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.1995.513067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New methods of solving a frequently encountered class of two-valued Boolean equations are presented. These methods are more direct and simpler to apply than existing techniques. Karnaugh maps employing the paradigm that distinguishes between "don't-care" and "can't-happen" conditions are used to present the methods. The techniques can easily be computerized.