Boolean Matching with Abstraction and Dynamic Learning
碩士 === 臺灣大學 === 電子工程學研究所 === 98 === Boolean matching determines whether two given Boolean functions can be identical to each other under permutation and/or negation of their input and output variables. In this thesis, we focus on the computation kernel of Boolean matching and propose a complete gene...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63864700278674748385 |