Name
Abstract | ||
|---|---|---|
We consider the problem of detecting the equivalence of two single-output Boolean functions,considering the permutation and complementation of their inputs, complementation ofoutputs, and their associated don't-care sets. This is often referred to as the Boolean matching problem. Boolean matching is a verification problem, and it has important applicationsin logic synthesis problems such as technology-mapping [1, 2, 3]. In this paper, we present anew algorithm for solving the Boolean... |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/EURDAC.1993.410660 | EURO-DAC |
Field | DocType | ISBN |
Maximum satisfiability problem,Boolean network,Boolean circuit,Computer science,Parity function,Algorithm,Theoretical computer science,Product term,Standard Boolean model,Boolean expression,Two-element Boolean algebra | Conference | 0-8186-4350-1 |
Citations | PageRank | References |
5 | 0.57 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kuang-chien Chen | 1 | 347 | 30.84 |