A Relay-Tree Method for Simplifying Boolean Functions
| dc.citation.epage | 58 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 48 | en_US |
| dc.citation.volume | 8 | en_US |
| dc.contributor.author | 羅浩榮 | zh_TW |
| dc.contributor.author | Hao-Yung Lo | en_US |
| dc.date.accessioned | 2017-10-06T06:17:27Z | |
| dc.date.available | 2017-10-06T06:17:27Z | |
| dc.date.issued | 1975-07 | en_US |
| dc.description.abstract | Generally there are two methods for simplifying Boolean functions; one is the Karnaugh Map Method, and the other, the Quine-Mccluskey Tabular Method. | zh_TW |
| dc.identifier.journal | 交大學刊 | zh_TW |
| dc.identifier.journal | SCIENCE BULLETIN NATIONAL CHIAO-TUNG UNIVERSITY | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/137402 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | 交大學刊編輯委員會 | zh_TW |
| dc.title | A Relay-Tree Method for Simplifying Boolean Functions | en_US |
| dc.type | Campus Publications | en_US |